Java maybe the shortest code


  • 1

    // power of 2 must have only 1 set bit
    ,n & (n - 1) removes lowest set bit which is the only set bit, so n&(n-1) == 0
    , power must be positive

    public class Solution {
        public boolean isPowerOfTwo(int n) {
            return n > 0 && (n & (n - 1)) == 0; 
        }
    }

Log in to reply
 

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