leetcode 693. Binary Number with Alternating Bits

交替位二进制数判断

最新推荐文章于 2018-06-30 23:18:25 发布

原创最新推荐文章于 2018-06-30 23:18:25 发布 · 272 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

693. Binary Number with Alternating Bits

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.

class Solution {
public:
     bool hasAlternatingBits(int n) {
        //解法2
        int k=n&1;
        n>>=1;
        while (n){
            int j=n&1;
            if (k==j)return false;
            k=j;
            n>>=1;
        }
        return true;
    }
};