[LeetCode] 693. Binary Number with Alternating Bits_Easy

发布时间：2020-12-14 03:48:02 所属栏目：大数据来源：网络整理

导读：Given a positive integer,check whether it has alternating bits: namely,if two adjacent bits will always have different values. Example 1: Input: 5Output: TrueExplanation:The binary representation of 5 is: 101 ? Example 2: Input: 7Output: F

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

（编辑：李大同）

【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容!