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) {
        int b1 = n % 2, b2 = -1;
        n >>= 1;
        while(n){
            b2 = n % 2;
            if(b2 == b1) return false;
            b1 = b2;
            n >>= 1;
        }
        return true;
    }
};

思路：除了上述常规解法。如果该数是交替出现01，那么移位后也是交替出现的，然后将两者异或得到0000…1111的数，然后使用判断是否是2的整数次幂的方法即可

class Solution {
public:
    bool hasAlternatingBits(int n) {
        int m = n ^ (n >> 1);
        return (m & (m + 1)) ? 0 : 1;
    }
};