Solution (leetcode-in-java 1.19 API)

java.lang.Object
- g0601_0700.s0693_binary_number_with_alternating_bits.Solution

```
public class Solution
extends Object
```
693 - Binary Number with Alternating Bits.
Easy

Given a positive integer, check whether it has alternating bits: namely, if two adjacent bits will always have different values.

Example 1:

Input: n = 5

Output: true

Explanation: The binary representation of 5 is: 101

Example 2:

Input: n = 7

Output: false

Explanation: The binary representation of 7 is: 111.

Example 3:

Input: n = 11

Output: false

Explanation: The binary representation of 11 is: 1011.

Constraints:
- 1 <= n <= 2³¹ - 1

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  boolean hasAlternatingBits(int n)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

hasAlternatingBits

public boolean hasAlternatingBits(int n)