【LeetCode 50】Pow(x, n)

题目描述

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]

思路

1. 递归，注意边界。n为负时，x=INT_MIN时，直接变为相反数会越界。
2. 非递归，分解n，二进制位为1的位置做计算。

代码

1. 递归

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

2. 非递归

class Solution {
public:
    double myPow(double x, int n) {
        double p = x;
        int m = n;
        if (m < 0) {
            p = 1/p;
            m = -n-1;
        }
        double res = 1.0;
        for (; m > 0; m >>= 1) {
            if (m&1) res *= p;
            p *= p;
        }
        return n < 0 ? res*1/x : res;
    }
};