leetcode#50 Pow(x, n)

mplement pow(x, n), which calculates x raised to the power n (xn).

Example 1:

Input: 2.00000, 10
Output: 1024.00000
Example 2:

Input: 2.10000, 3
Output: 9.26100
Example 3:

Input: 2.00000, -2
Output: 0.25000
Explanation: 2-2 = 1/22 = 1/4 = 0.25
Note:

-100.0 < x < 100.0
n is a 32-bit signed integer, within the range [−231, 231 − 1]

思路
shipin

       class Solution {
    public double myPow(double x, int n) {
        
      
      
        if (n == 0) return 1;
        double half = myPow(x, n / 2);
        if (n % 2 == 0) return half * half; //如果n是偶数 直接给他一半的平方即可
        if (n > 0) return half * half * x;//如果n是正数且是奇数则给他一半的平方乘x
        return half * half / x;
        
    }
}
        

这种解法的最后一句如果为负数是 return half * half / x;
怎么想也想不明白难道不应该是 1/x^n次方吗？为什么是half*half/x？
希望懂得人给我解答