Package g0201_0300.s0231_power_of_two

Class Solution

java.lang.Object

g0201_0300.s0231_power_of_two.Solution

public class Solution
extends Object

231 - Power of Two.<p>Easy</p> <p>Given an integer <code>n</code>, return <em><code>true</code> if it is a power of two. Otherwise, return <code>false</code></em>.</p> <p>An integer <code>n</code> is a power of two, if there exists an integer <code>x</code> such that <code>n == 2^x</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> n = 1</p> <p><strong>Output:</strong> true</p> <p><strong>Explanation:</strong> 2⁰ = 1</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> n = 16</p> <p><strong>Output:</strong> true</p> <p><strong>Explanation:</strong> 2⁴ = 16</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> n = 3</p> <p><strong>Output:</strong> false</p> <p><strong>Example 4:</strong></p> <p><strong>Input:</strong> n = 4</p> <p><strong>Output:</strong> true</p> <p><strong>Example 5:</strong></p> <p><strong>Input:</strong> n = 5</p> <p><strong>Output:</strong> false</p> <p><strong>Constraints:</strong></p> <ul> <li><code>-2³¹ <= n <= 2³¹ - 1</code></li> </ul> <p><strong>Follow up:</strong> Could you solve it without loops/recursion?</p>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
boolean	isPowerOfTwo(int n)

Methods inherited from class java.lang.Object

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

Constructor Details

Solution

public Solution()

Method Details

isPowerOfTwo

public boolean isPowerOfTwo(int n)