力扣每日一题（难的我也不会）693. 交替位二进制数（2022.3.28）

693. 交替位二进制数

给定一个正整数，检查它的二进制表示是否总是 0、1 交替出现：换句话说，就是二进制表示中相邻两位的数字永不相同。

话不多说，直接打表

class Solution {
    public boolean hasAlternatingBits(int n) {
        return 1 == n || 2 == n || 5 == n || 10 == n || 21 == n || 42 == n || 85 == n || 170 == n || 341 == n || 682 == n || 1365 == n || 2730 == n || 5461 == n || 10922 == n || 21845 == n || 43690 == n || 87381 == n || 174762 == n || 349525 == n || 699050 == n || 1398101 == n || 2796202 == n || 5592405 == n || 11184810 == n || 22369621 == n || 44739242 == n || 89478485 == n || 178956970 == n || 357913941 == n || 715827882 == n || 1431655765 == n;
    }
} 

睡觉！！！