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]

源码：

指数的非 递归 分治法，否则会超时。

还有个注意的就是INT类型的正负边界，[−2的31次, 2的31次 − 1]，特殊处理负边界

class Solution {
public:
    double myPow(double x, int n) {
        double result = 1;
        int n_con = 0;
        if(x==1 || x==0)    return x;
        
        if(n==0)    return 1;
        else if(n==1)   return x;
        else if(n==-2147483648)     n_con = 2147483647;
        else if(n<=0)    n_con = -n;
        else    n_con = n;
        
        /* for(int i=0; i<n_con; i++){
            result *= x;
        }*/
        
        double temp = x;
        while(n_con>1){
            if(n_con & 1 == 1)
                result *= temp;
            n_con /= 2;
            // cout<<n_con<<endl;
            temp = temp * temp;
        }
        // cout<<result<<" "<<temp<<endl;
        result *= temp;
        
        if(n==-2147483648)  result *= x;
        
        if(n<0)     return 1.0/result;
        else    return result;
    }
};