LeetCode - Pow(x, n)

解法一 recursion

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

优化

class Solution {
public:
    double myPow(double x, int n) {
        if(n==0) return 1;
        double cur = myPow(x, n/2);
        if(n%2==0) return cur*cur;
        else if(n>0) return cur*cur*x;
        else return cur*cur/x;
    }
};

解法二 iterative

class Solution {
public:
    double myPow(double x, int n) {
        double res = 1.0;
        for (int i = n; i != 0; i /= 2) {
            if (i % 2 != 0) res *= x;
            x *= x;
        }
        return n < 0 ? 1 / res : res;
    }
};