Package g0201_0300.s0231_power_of_two

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    231 - Power of Two.

    Easy

    Given an integer n, return true if it is a power of two. Otherwise, return false.

    An integer n is a power of two, if there exists an integer x such that <code>n == 2<sup>x</sup></code>.

    Example 1:

    Input: n = 1

    Output: true

    Explanation: 2<sup>0</sup> = 1

    Example 2:

    Input: n = 16

    Output: true

    Explanation: 2<sup>4</sup> = 16

    Example 3:

    Input: n = 3

    Output: false

    Constraints:

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

    Follow up: Could you solve it without loops/recursion?

    • 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 isPowerOfTwo(Integer n)

      • Methods inherited from class java.lang.Object

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