class Solution(object):
def hasAlternatingBits(self, n):
"""
:type n: int
:rtype: bool
"""
if n == 0:
return True
s = bin(n)[2:]
m = s[::2]
n = s[1:len(s):2]
if "0" not in m and "1" not in n:
return True
return False
leetcode - 693 - 交替位二进制数
最新推荐文章于 2022-03-28 12:35:15 发布