题目描述:
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?
不使用循环和递归,判断一个数是否为4的幂,利用log函数可以解决。
class Solution {
public:
bool isPowerOfFour(int num) {
if(num<=0) return false;
double k=log10(num)/log10(4);
if(ceil(k)==floor(k)) return true;
else return false;
}
};