LeetCode 50. Pow(x, n)

 

时间复杂度是N的话，易超时，下面是时间复杂度为logN

public static double myPow(double x, int n) {
        double r = 1.0;
        for (int i = n; i != 0 ; i/=2) {
            if(i%2!=0){
                r*=x;
            }
            x*=x;
        }
        return n < 0 ? 1 / r : r;
    }