kniost

谁怕，一蓑烟雨任平生

0%

LeetCode 50. Pow(x, n)

发表于 更新于 分类于
本文字数： 1.3k 阅读时长 ≈ 1 分钟
LeetCode 50. Pow(x, n)

50. Pow(x, n)

Difficulty:: Medium

Implement , which calculates x raised to the power n (xn).

Example 1:

1
2
Input: 2.00000, 10
Output: 1024.00000

Example 2:

1
2
Input: 2.10000, 3
Output: 9.26100

Example 3:

1
2
3
Input: 2.00000, -2
Output: 0.25000
Explanation: 2-2 = 1/22 = 1/4 = 0.25

Note:

  • -100.0 < x < 100.0
  • n is a 32-bit signed integer, within the range [−231, 231 − 1]

Solution

Language: Java

位运算

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
class Solution {
    public double myPow(double x, int n) {
        if (x == 0) {
            return 0;
        }
        if (n == 0) {
            return 1;
        }
        long c = Math.abs((long) n);
        double result = 1;
        while (c > 0) {
            if ((c & 1) == 1) {
                result *= x;
            }
            x *= x;
            c >>= 1;
        }
        return n < 0 ? 1 / result : result;
    }
}

递归

1
2
3
4
5
6
7
8
9
10
11
public class Solution {
    public double pow(double x, int n) {
        if(n == 0)
            return 1;
        if(n<0){
            n = -n;
            x = 1/x;
        }
        return (n%2 == 0) ? pow(x*x, n/2) : x*pow(x*x, n/2);
    }
}

递归麻烦版

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
class Solution {
    public double myPow(double x, int n) {
        if (x == 0) {
            return 0d;
        }
        if (n == 0) {
            return 1d;
        }
        if (n < 0) {
            x = 1 / x;
            n = -n;
        }
        
        return pow(x, n);
        
    }
    
    private double pow(double x, int n) {
        if (n == 0) {
            return 1d;
        }
        if (n == 1) {
            return x;
        }
        if (n == 2) {
            return x * x;
        }
        double tmp = pow(x, n / 2);
        if (n % 2 == 0) {
            return tmp * tmp;
        } else {
            return tmp * tmp * x;
        }
    }
}