Commit 6e18ef5

ybian19azl397985856

authored and

committed

feat: 342.power-of-four add Python3 implementation (azl397985856#144)

1 parent 2eef0e1 commit 6e18ef5Copy full SHA for 6e18ef5

File tree

+26

-0

lines changed

+26

-0

lines changed

Lines changed: 26 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -80,8 +80,13 @@ return num > 0 && num & (num - 1 === 0) && (num - 1) % 3 === 0;`
`80`	`80`	`- 数论`
`81`	`81`	`- 2的幂次方特点(数学性质以及二进制表示)`
`82`	`82`	`- 4的幂次方特点(数学性质以及二进制表示)`
	`83`	`+`
`83`	`84`	`## 代码`
`84`	`85`
	`86`	`+语言支持:JS, Python`
	`87`	`+`
	`88`	`+JavaScript Code:`
	`89`	`+`
`85`	`90`	```js
`86`	`91`	`/*`
`87`	`92`	`* @lc app=leetcode id=342 lang=javascript`
`@@ -103,3 +108,24 @@ var isPowerOfFour = function(num) {`
`103`	`108`	`return (num & 0x55555555) === num;`
`104`	`109`	`};`
`105`	`110`	```
	`111`	`+`
	`112`	`+Python Code:`
	`113`	`+`
	`114`	+```python
	`115`	`+class Solution:`
	`116`	`+ def isPowerOfFour(self, num: int) -> bool:`
	`117`	`+ if num == 1:`
	`118`	`+ return True`
	`119`	`+ elif num < 4:`
	`120`	`+ return False`
	`121`	`+ else:`
	`122`	`+ if not num & (num-1) == 0:`
	`123`	`+ return False`
	`124`	`+ else:`
	`125`	`+ return num & 0x55555555 == num`
	`126`	`+`
	`127`	`+ # 另一种解法:将数字转化为二进制表示的字符串,利用字符串的相关操作进行判断`
	`128`	`+ def isPowerOfFour(self, num: int) -> bool:`
	`129`	`+ binary_num = bin(num)[2:]`
	`130`	`+ return binary_num.strip('0') == '1' and len(binary_num) % 2 == 1`
	`131`	+```

Comments

(0)