@@ -0,0 +1,463 @@
+/**%0A * https://oj.leetcode.com/problems/powx-n/%0A * %3Cp/%3E%0A * Implement pow(x, n).%0A */%0Apublic class Pow %7B%0A    public double pow(double x, int n) %7B%0A        if (n %3C 0) return 1.0 / power(x, -n);%0A%0A        return power(x, n);%0A    %7D%0A%0A    private double power(double x, int n) %7B%0A        if (n == 0) return 1;%0A        double tmp = power(x, n / 2);%0A        if (n %25 2 == 0) %7B%0A            return tmp * tmp;%0A        %7D else %7B%0A            return tmp * tmp * x;%0A        %7D%0A    %7D%0A%7D%0A

Implement pow(x, n)