def is_power_of_two(n):
return n>0 and (n&(n-1))==0
public boolean isPowerOfTwo(int n){
return n>0&&(n&(n-1))==0;
}
Power of 2 has one bit set. n&(n-1) clears it. Nearly identical.
def is_power_of_two(n):
return n>0 and (n&(n-1))==0
public boolean isPowerOfTwo(int n){
return n>0&&(n&(n-1))==0;
}
1. Positive and one bit set 2. n&(n-1) clears lowest bit