这道题要求计算 X 的 n 次幂,如果采用普通解法,无法AC,会提示超时,因此采用递归实现二分法,将时间复杂度由 O(n) 提升到 O(logn)。
class Solution(object):
def myPow_time_limit(self, x, n): #这样会超时
count = 0
result = 1
while count < abs(n):
result *= x
count += 1
if n < 0:
result = 1/result
return result
def _myPowDiGui(self, x, n): #递归
if n == 0:
return 1
res = self._myPowDiGui(x, n//2)
if n % 2 == 0:
return res * res
else:
return res * res * x
def myPow(self, x, n):
if n < 0:
return 1 / self._myPowDiGui(x, abs(n))
else:
return self._myPowDiGui(x, n)
A = Solution()
result = A.myPow(3, 2)
print(result)