原题:
Given an integer (signed 32 bits), write a function to check whether it is a power of 4.
Example:
Given num = 16, return true. Given num = 5, return false.
Follow up: Could you solve it without loops/recursion?
这其实是一道很简单的题,但是有助于理解机器数,详见:http://www.cnblogs.com/zhangziqiu/archive/2011/03/30/ComputerCode.html
用一行python代码可以解题:
class Solution(object):
def isPowerOfFour(self, num):
"""
:type num: int
:rtype: bool
"""
return not (num&(num-1)) and (num&0x55555555!=0)
其中 not num&(num-1)可以保证 num用二进制表示时,只有最高位为1;num&0x55555555!=0可以保证num用二进制表示时,在(2n+1)位上有值为1