Python Leetcode 50. Pow(x, n)

Python Leetcode 50. Pow(x, n)

# 递归
class Solution(object):
    def myPow(self, x, n):
        """
        :type x: float
        :type n: int
        :rtype: float
        """
        def quickmul(N):
            if N ==0:
                return 1.0
            y = quickmul(N/2)
            if N%2 == 0:
                return y*y
            else:
                return y*y*x
        
        return quickmul(n) if n>0 else 1/quickmul(-n)

# 非递归
class Solution(object):
    def myPow(self, x, n):
        """
        :type x: float
        :type n: int
        :rtype: float
        """
        def quickmul(N):
            ans = 1.0
            x_con = x
            while N>0:
                if N%2 == 1:
                    ans *= x_con
                x_con *= x_con
                N //=2
            return ans

        return quickmul(n) if n>0 else 1.0/quickmul(-n)