[LeetCode] 693. Binary Number with Alternating Bits - Java

• 문제 링크

Binary Number with Alternating Bits - LeetCode

 

• 풀이 코드

public class Solution {

    public boolean hasAlternatingBits(int n) {
        n ^= (n >> 1);
        return (n & (n + 1)) == 0;
    }

}