#-*- coding: UTF-8 -*-
class Solution(object):
def isPowerOfTwo(self, n):
if(n<=0):
return False
if(n==1):
return True
while True:
tuple=divmod(n,2)
if tuple[1]!=0:
return False
if tuple[0]==1:
return True
n=tuple[0]
sol=Solution()
print sol.isPowerOfTwo(1025)
相关文章
- 【leetcode❤python】326. Power of Three
- 【一天一道LeetCode】#231. Power of Two
- 【LeetCode 231】Power of Two
- [LeetCode] Power of Two 判断2的次方数
- [LeetCode&Python] Problem 371. Sum of Two Integers
- LeetCode - 231. Power of Two - 判断一个数是否2的n次幂 - 位运算应用实例 - ( C++ )
- Leetcode4:Median of Two Sorted Arrays@Python
- Leetcode2:Add Two Numbers@Python
- 231. Power of Two 342. Power of Four -- 判断是否为2、4的整数次幂
- [LeetCode] 231 Power of Two && 326 Power of Three && 342 Power of Four