题目:
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?
思路:
1、递归版本:4的幂的二进制有什么特点呢?就是最高位是1,后面跟着偶数个0。根据这个特点可以写出递归版本:当num < 4的时候,直接判断并且返回;当num >= 4的时候,