Package g0601_0700.s0693_binary_number_with_alternating_bits

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    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:

    • <code>1 <= n <= 2<sup>31</sup> - 1</code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Boolean hasAlternatingBits(Integer n)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait