LEETCODE-- Power of Four
2017-02-20 09:53
323 查看
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?
Example:
Given num = 16, return true. Given num = 5, return false.
Follow up: Could you solve it without loops/recursion?
class Solution {
public:
bool isPowerOfFour(int num) {
return !(num & num-1) && ((num - 1) % 3 == 0);
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode 第 342 题(Power of Four)
- LeetCode(65)-Power of Four
- 【LeetCode-342】 Power of Four(C++)
- [Leetcode]Power of Four
- 【Leetcode】Power of Four
- [LeetCode]Power of Four
- Leetcode Power of Four 342
- leetcode---Power of Four
- leetcode 342 Power of four
- LeetCode 第 342 题（Power of Four）
- leetcode笔记：Power of Four
- leetcode. Power of Four-四次方|位运算
- LeetCode Power of Four
- [LeetCode] Power of Four
- leetcode_324_Power of Four(C++)(easy)
- LeetCode(65)-Power of Four
- 【LeetCode-342】Power of Four
- Power of Four leetcode 342
- leetcode 342 Power of Four C++
- Leetcode 342 Power of Four