LeetCode No342. Power of Four

1. 题目描述

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?

2. 思路

判断一个数是否为4的幂，可转化成2的偶数次方，即判断一个数的位级表示只有一个1，且此1在偶数下标。

3. 代码

class Solution {
public:
    bool isPowerOfFour(int num) {
        if (num < 1) return false;
        bitset<32> b(num);
        if (b.count() != 1) return false;
        string s = b.to_string();
        return s.find('1') % 2;
    }
};

4. 参考资料

1. c++primer : 17.2.2 bitset操作