leetcode -- 50. Pow(x, n)

题目描述

题目难度：Medium
Implement pow(x, n), which calculates x raised to the power n (xn).

• Example 1:

Input: 2.00000, 10
Output: 1024.00000

• Example 2:

Input: 2.10000, 3
Output: 9.26100

• Example 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]

AC代码1

递归方法，好理解

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);
    }
}

AC代码2

方法1的非递归版本，不好理解，参照代码1可以更好地理解此代码

class Solution {
    
    public double myPow(double x, int n) {
        long m = n;
        if (n < 0) {
            m = -m;
            x = 1/x;
        }
        double res = 1;
        while (m > 0) {
            if (m % 2 == 1)
                res *= x;
            x *= x;
            m /= 2;
        }
        return res;
    }
}