代码改变世界

[LeetCode] 693. Binary Number with Alternating Bits_Easy

2018-08-28 00:42  Johnson_强生仔仔  阅读(238)  评论(0)  编辑  收藏  举报

Given a positive integer, check whether it has alternating bits: namely, if two adjacent bits will always have different values.

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.

 

Example 4:

Input: 10
Output: True
Explanation:
The binary representation of 10 is: 1010.

 

 

判断"00" 和"11"是否在str(bin(n))里面即可.

 

Code

class Solution:
    def alternateBits(self, n):
        n = bin(n)
        return "00" not in n and "11" not in n