In binary, a power of two has exactly one bit set (e.g. 4 = 100).

Power of Two

medium

Acceptance: 43%

Bit ManipulationMath

Determine whether a given integer is an exact power of two. An integer n qualifies if there exists some non-negative integer k such that 2^k equals n.

Examples

Example 1:

Input:n = 8

Output:true

Example 2:

Input:n = 10

Output:false

Hints

1234567

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

Power of Two

Examples

Hints

Related Problems