LeetCode---Pow(x, n)

Implement 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]

主要在于简化求解2^8 = 4^4 = 16^2

class Solution:
    def myPow(self, x, n):
        if n==0:
            return 1.0
        elif n<0:
            return 1/self.myPow(x,-n)
        elif n%2:
            return self.myPow(x*x,n//2)*x
        else:
            return self.myPow(x*x,n//2)