Given a positive integer, check whether it has alternating bits: namely, if two adjacent bits will always have different values.
判断正整数的二进制数是否全为交替位。
也就是说只要存在“00”或者“11”即为否。
Example 1:
Input: 5 Output: True Explanation: The binary representation of 5 is: 101
Example 2:
Input: 7 Output: False Explanation: The binary representation of 7 is: 111.
Example 3:
Input: 11 Output: False Explanation: The binary representation of 11 is: 1011.
扫描二维码关注公众号，回复：
5764113 查看本文章
Example 4:
Input: 10 Output: True Explanation: The binary representation of 10 is: 1010.
class Solution:
def hasAlternatingBits(self, n):
"""
:type n: int
:rtype: bool
"""
num = bin(n)
if '11' in num or '00' in num :
return False
else:
return True
def hasAlternatingBits(self, n):
"""
:type n: int
:rtype: bool
"""
num = bin(n)
if '11' in num or '00' in num :
return False
else:
return True