[leetcode] 50. Pow(x, n) @ python

原题

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]

解法1

python语法

代码

class Solution(object):
    def myPow(self, x, n):
        """
        :type x: float
        :type n: int
        :rtype: float
        """
        return x**n

解法2

递归. base case是当n = 0时, 返回1, 当n为负数时, 取x^(-n)的倒数, 当n为奇数时, 用x^(n-1)*n, 当n为偶数时, 返回x^2的n/2次方.
Time: O(log(n))
Space: O(1)

代码

class Solution(object):
    def myPow(self, x, n):
        """
        :type x: float
        :type n: int
        :rtype: float
        """
        if n == 0:
            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)