Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

public class Solution { public boolean isPowerOfFour(int n) { return (n>0 && Integer.bitCount(n) == 1 && ((Math.log(n)/Math.log(2))%2==0)); } }

Nice solution. The bitCount(n) == 1 here is redundant since it itself implies n>0.

bitCount(n) == 1

n>0

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.