LeetCode——Pow(x, n)

Implement pow(x, n).

原题链接：https://oj.leetcode.com/problems/powx-n/

public double pow(double x, int n) {if(n== 0)return 1;if(n == 1)return x;if(n % 2 ==0)return pow(x*x,n/2);else{if(n > 0)return x*pow(x*x,n/2);elsereturn pow(x*x,n/2)/x;}}