Implement pow(x, n).
Subscribe to see which companies asked this question.
public class Solution {
public double myPow(double x, int n) {
if(n==0)
return 1;
double mid = myPow(x,n/2);
if(n%2==0)
return mid*mid;
else{
if(n>0)
return mid*mid*x;
else
return mid*mid*(1/x);
}
}
}
分治法,时间复杂度O(nlogn)