每日一题-LeetCode693-交替二进制数-位运算

原题链接

class Solution {
public:
    bool hasAlternatingBits(int n) {
        vector ans;
        int i = 0;
        while(n){
            if(n & 1) ans.push_back(1);
            else    ans.push_back(0);
            n = n >> 1;
        }
        for(int i = 1; i < ans.size(); i ++)
            if(ans[i] == ans[i - 1])    return false;
        
        return true;
    }
};