Leetcode50-Pow(x,n) 代码 class Solution: def myPow(self, x: float, n: int) -> float: res = 1 n1 = abs(n) while n1: if n1 % 2 == 1: res *= x n1 //= 2 x *= x if n > 0: return res else: return 1 / res