【Leetcode_easy】693. Binary Number with Alternating Bits

problem

693. Binary Number with Alternating Bits

solution1:

class Solution {
public:
    bool hasAlternatingBits(int n) {
        int bit = -;
        while(n>)
        {
            /*
            errr...
            if(n&1 && bit==1) return false;
            else if(n&1) bit = 1;
            if(n&1==0 && bit==0) return false;
            else if(n&1==0) bit = 0;
            */
            if(n&==)
            {
                if(bit==) return false;
                bit = ;
            }
            else
            {
                if(bit==) return false;
                bit = ;
            }
            n >>= ;//err.
        }
        return true;
    }
};

solution2:

通过异或操作判断最低位是否在0/1之间转换进行。

class Solution {
public:
    bool hasAlternatingBits(int n) {
        int d = (n&);
        while((n&)==d)
        {
            d ^= ;//
            n >>= ;
        }
        return n==;
    }
};

参考

1. Leetcode_easy_693. Binary Number with Alternating Bits;

2. Grandyang;

完