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 {public boolean isPowerOfFour(int num) {return num>0&&Integer.bitCount(num)==1&&(num&0x55555555)!=0;}}
[welcome to my blog][] LeetCode 342. Power of Four (Java版; Easy) 题目描述 Given
Topic Bit Manipulation Description [https://leetcode.com/problems/power-of-four/]
Given an integer (signed 32 bits), write a function to check whether it is a power of 4.
Given an integer, write a function to determine if it is a power of three. Follow up:
Given an integer, write a function to determine if it is a power of two. public cla
Given an integer, write a function to determine if it is a power of two. public cla
1.题目 Given an integer (signed 32 bits), write a function to check whether it is a pow
/ Given an integer (signed 32 bits), write a function to check whether it is a p
Given an integer (signed 32 bits), write a function to check whether it is a power of 4.
Given an integer, write a function to determine if it is a power of two. Example 1:
绝地灬酷狼
左手的ㄟ右手
野性酷女
还没有评论，来说两句吧...