Leetcode 231. Power of Two

https://leetcode.com/problems/power-of-two/

2 one line solutions.

Solution 1:
return bin(n)[2:].count('1') == 1 and n > 0
Run time 64 ms;

Solution 2:
return n > 0 and (n & (n - 1)) == 0
Run time: 60 ms.