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，经典的数学解法：

class Solution(object):def isPowerOfFour(self, num):""":type num: int:rtype: bool"""if num <= 0: return Falsen = int(round(math.log(num, 4)))return 4**n == num

解法2，迭代：

class Solution(object):def isPowerOfFour(self, num):""":type num: int:rtype: bool"""if num <= 0: return Falsewhile num >= 4:if num % 4 != 0:return Falsenum = num / 4    return num == 1

解法3，最牛叉，

class Solution(object):def isPowerOfFour(self, num):""":type num: int:rtype: bool"""return num > 0 and (num & (num - 1)) == 0 and (num - 1) % 3 == 0

因为，4^n - 1 = C(n,1)*3 + C(n,2)*3^2 + C(n,3)*3^3 +.........+ C(n,n)*3^n
i.e (4^n - 1) = 3 * [ C(n,1) + C(n,2)*3 + C(n,3)*3^2 +.........+ C(n,n)*3^(n-1) ]
This implies that (4^n - 1) is multiple of 3.

类似解法：

return n & (n-1) == 0 and n & 0xAAAAAAAA == 0

或者是：

class Solution(object):def isPowerOfFour(self, n):""":type num: int:rtype: bool"""         #1, 100, 10000, 1000000, 100000000, ....#1, 100 | 10000 | 1000000 | 100000000, ... = 0101 0101 0101 0101 0101 0101 0101 0101return n > 0 and n & (n-1) == 0 and (n & 0x55555555 != 0)

因为n & n-1 == 0 就可以确定只有1个1， so 只要保证1的位置在1，3，5，7，。。。。这些位置上就行。

转载于:https://www.cnblogs.com/bonelee/p/9206525.html

leetcode 342. Power of Four相关推荐

[leetcode] 342. Power of Four
题目 Given an integer (signed 32 bits), write a function to check whether it is a power of 4.Example: ...
[LeetCode] 342. Power of Four（位操作）
传送门 Description Given an integer (signed 32 bits), write a function to check whether it is a power o ...
[LeetCode][JavaScript]Power of Three
Power of Three Given an integer, write a function to determine if it is a power of three. Follow up: ...
LeetCode:326. Power of Three
2019独角兽企业重金招聘Python工程师标准>>> Given an integer, write a function to determine if it is a powe ...
leetcode 231. Power of Two
Given an integer, write a function to determine if it is a power of two. class Solution(object):def ...
LeetCode - 231. Power of Two
Given an integer, write a function to determine if it is a power of two. Example 1: Input: 16 Output ...
LeetCode之Power of Two
1.题目 Given an integer, write a function to determine if it is a power of two. Credits: Special thank ...
LeetCode 342. 4的幂（位运算）
文章目录 1. 题目 2. 解题 2.1 通用解法 2.2 找规律 1. 题目给定一个整数 (32 位有符号整数),请编写一个函数来判断它是否是 4 的幂次方. 示例 1: 输入: 16 输出: t ...
LeetCode 326. Power of Three
题目: Given an integer, write a function to determine if it is a power of three. Follow up: Could you ...

leetcode 342. Power of Four

leetcode 342. Power of Four相关推荐

最新文章

热门文章