* n = 2 ^ 0 = 1 = 0b0000…00000001, and (n - 1) = 0 = 0b0000…0000. * n = 2 ^ 1 = 2 = 0b0000…00000010, and (n - 1) = 1 = 0b0000…0001. * n = 2 ^ 2 = 4 = 0b0000 ...
Given an integer n, return true if it is a power of two. Otherwise, return false. An integer n is a power of two, if there exists an integer x such that n == 2x.
So, you want to get good at LeetCode, especially using Java? It’s a common goal for a lot of us trying to land those tech jobs. This guide is all about helping you get there. We’ll go over how to ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback