[LeetCode] 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：暴力法，直接循环，注意处理一下复数

class Solution {
public:
    double myPow(double x, int n) {
        long long N = n;
        if(N < 0)
        {
            x = 1/x;
            N = -N;
        }        

        double res = 1;
        for(long long i = 0;i < N;i++)
        {
            res *= x;
        }
        return res;
    }
};

暴力法超时，所以考虑用递归折半算，时间复杂度为O(logn)，每次把n缩小一半，求其half，再计算平方返回即可。此外需注意一下奇偶数，偶数直接平方，奇数平方后还再需*x

class Solution {
public:
    double myPow(double x, int n) {
        long long N = n;
        if(N < 0)
        {
            x = 1/x;
            N = -N;
        }

        return helper(x,N);

    }

    double helper(double x,long long n)
    {
        if(n == 0)
            return 1.0;
        double half = helper(x, n /2);
        if(n % 2 == 0)
        {
            return half*half;
        }
        else
        {
            return half*half*x;
        }
    }
};