leetcode 50.Pow(x, n) python

分而治之

class Solution:
    def myPow(self, x: float, n: int) -> float:
        if not n:
            return 1
        if n <0:
            return 1/self.myPow(x, -n)
        if n%2:
            return x*self.myPow(x, n-1)
        return self.myPow(x*x, n/2)

位运算

class Solution:
    def myPow(self, x: float, n: int) -> float:
        if n < 0:
            x = 1 / x
            n = -n
        pow = 1
        while n:
            if n & 1:
                pow *= x
            x *= x
            n >>=1
        return pow