50. Pow(x, n)

Implement pow(x, n).

Subscribe to see which companies asked this question

解释：

递归求解，将复杂度降低。

代码：

// #define DBL_MAX 1.7976931348623158e+308 /* max value */
// #define DBL_MIN 2.2250738585072014e-308 /* min positive value */
inline double sqr(double t) {return t*t;}
class Solution {
public:
    double myPow(double x, int n) {
        double t= Pow(x,abs(n));
        if(n<0) return 1/t;
        else return t;
      }
      double Pow(double x, int n) {
        if(n==1) return x;
        if(n==0 ||x==1 ) return 1;
        // cout<<n<<endl;
        return  (n%2==0)?sqr(Pow(x,n/2)):(x*sqr(Pow(x,n/2)));   
      }
      
};