One line java solution


  • 0
    Z

    the highest bit is 1, all others are 0 which is a number power of 2. so solution as below

    public class Solution 
    {
        public boolean isPowerOfTwo(int n) 
        {
            return n <= 0 ? false : (n & (n - 1)) == 0;
        }
    }

Log in to reply
 

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