首页 > itarticle > [leetcode] problem 342 – power of four

[leetcode] problem 342 – power of four

admin 11月 13, 2020 0

Given an integer (signed 32 bits), write a function to check whether it is a power of 4.

Example

Input: 16

Output: true

Input: 5

Output: false

Could you solve it without loops/recursion?

public boolean (int num) {
    if (num <= 0)
        return false;
    
    
    return (num & (num - 1)) == 0 && (num & 0x55555555) == num;
}