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==0时，返回1

n为奇数，dicPow(x,n/2)*dicPow(x,n/2)*x;

n为偶数，dicPow(x,n/2)*dicPow(x,n/2)

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