要满足O(n)需用递归
pow(x,n) = pow(x,n/2)*pow(x,n/2) n为偶数时
pow(x,n) = pow(x,n/2)*pow(x,n/2)*x n为奇数时
double myPow(double x, int n) {
if(n<0)return 1/power(x,-n);
return power(x,n);
}
double power(double x,int n)
{
if(n==0)return 1;
double half=power(x,n/2);
if(n%2==0) return half*half;
return x*half*half;
}