[Leetcode] Pow(x, n) (Java)

Implement pow(x, n).

实现pow(x, n)函数

public class Solution {    public double pow(double x, int n) {if(Math.abs(x-1)<1e-6||n==0)return 1;if(n==Integer.MIN_VALUE){double d = pow(x, -n/2);return 1/d*d;}if(n<0)return 1/pow(x, -n);double d = pow(x, n/2);if(n%2==1)return d*d*x;return d*d;          }}