public class Solution {
public bool IsPowerOfFour(int num) {
return (num > 0) && ((num & (num - 1)) == 0) && ((num & 0x55555555) == num);
}
}
https://leetcode.com/problems/power-of-four/#/description
时间： 2024-08-07 04:00:59
leetcode342
leetcode342的相关文章
leetcode342合理运用位操作判断4的幂
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? 我的解法极其垃圾,建议不要看. public class Solution {
LeetCode191 Number of 1 Bits. LeetCode231 Power of Two. LeetCode342 Power of Four
位运算相关 三道题 231. Power of Two Given an integer, write a function to determine if it is a power of two. (Easy) 分析: 数字相关题有的可以考虑用位运算,例如&可以作为筛选器. 比如n & (n - 1) 可以将n的最低位1删除,所以判断n是否为2的幂,即判断(n & (n - 1) == 0) 代码: 1 class Solution { 2 public: 3 bool isP
leetcode342——Power of Four（C++）
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. 个人博客:http://www.cnblogs.com/wdfwolf3/ 这道题本身没有难度,这里只是介绍两种思路,当我们判断出它二进制只有1个1的时候,即必为2的幂时,如何进一步判断它是
LeetCode 342
Power of Four 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 /**********************