LeetCode 50. Pow(x,n)

Topic link ： Click here

First, a solution with the highest accuracy is introduced ：

$$x^n=e^{nlnx}$$

class Solution {
    
public:
    double myPow(double x, int n) {
    
        int sign = 1;
        if(x<0 && n&1)  sign = -1;
        x = abs(x);
        return sign*exp(n*log(x));
    }
};

Use the idea of multiplication , Fast power recursion ：

class Solution {
    
public:
    double fastPow(double x, long long n) {
    
        if (n == 0) return 1.0;
        double half = fastPow(x, n/2);
        if(n%2==0)  return half * half;
        else    return half * half * x;
    }

    double myPow(double x, int n) {
    
        long long N = n;
        if (N < 0) {
    
            x = 1 / x;
            N = -N;
        }
        return fastPow(x, N);
    }
};