快速幂;看下来其实就是幂运算拆成位运算的方法精简
class Solution {
public double myPow(double x, int n) {
if(x==0) return 0;
long b = n;
if(b < 0){
x = 1/x;
b = -b;
}
double res = 1.0;
while(b>0){
if((b&1)==1) res *= x;
x *= x;
b>>=1;
}
return res;
}
}