[leetcode] Implement pow(x, n). Subscribe to see which companies asked this question

class Solution {
public:
double myPow(double x, int n) {
if(n<0) return 1/power(x,-n);
else return power(x,n);
}

double power(double x, int n){
double res;
if(n==0) return 1;
double half = power(x,n/2);
if(n%2==0) return half*half;
else return x*half*half;
}
};