给定一个整数,写一个函数来判断它是否为2的幂次方
示例 1:
输入: 1 输出: true 解释: 20 = 1
示例 2:
输入: 16 输出: true 解释: 24 = 16
示例 3:
输入: 218 输出: false
1:while循环判断,注意整数为"0"的测试用例
def isPowerOfTwo(self, n):
"""
:type n: int
:rtype: bool
"""
if n == 0:
return False
while n%2 == 0:
n = n/2
if n == 1:
return True
else:
return False
2:&位与运算(参考他人)
def isPowerOfTwo(self, n):
"""
:type n: int
:rtype: bool
"""
if n == 0:
return False
n = n & (n - 1)
if n == 0:
return True
else:
return False
算法题来自:https://leetcode-cn.com/problems/power-of-two/description/