Commit b332699

ybian19azl397985856

authored and

committed

feat: 190.reverse-bits add Python3 implementation (azl397985856#112)

1 parent 26f5e44 commit b332699Copy full SHA for b332699

File tree

1 file changed

+21

-5

lines changed

problems
- 190.reverse-bits.md

1 file changed

+21

-5

lines changed

`‎problems/190.reverse-bits.md‎`

Lines changed: 21 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -6,7 +6,7 @@ https://leetcode.com/problems/reverse-bits/description/`
`6`	`6`	```
`7`	`7`	`Reverse bits of a given 32 bits unsigned integer.`
`8`	`8`
`9`		`-`
	`9`	`+`
`10`	`10`
`11`	`11`	`Example 1:`
`12`	`12`
`@@ -18,7 +18,7 @@ Example 2:`
`18`	`18`	`Input: 11111111111111111111111111111101`
`19`	`19`	`Output: 10111111111111111111111111111111`
`20`	`20`	`Explanation: The input binary string 11111111111111111111111111111101 represents the unsigned integer 4294967293, so return 3221225471 which its binary representation is 10101111110010110010011101101001.`
`21`		`-`
	`21`	`+`
`22`	`22`
`23`	`23`	`Note:`
`24`	`24`
`@@ -44,7 +44,7 @@ In Java, the compiler represents the signed integers using 2's complement notati`
`44`	`44`
`45`	`45`	`1. 可以用任何数字和1进行位运算的结果都取决于该数字最后一位的特性简化操作和提高性能`
`46`	`46`
`47`		`-eg :`
	`47`	`+eg :`
`48`	`48`
`49`	`49`	`- n & 1 === 1, 说明n的最后一位是1`
`50`	`50`	`- n & 1 === 0, 说明n的最后一位是0`
`@@ -58,12 +58,11 @@ eg :`
`58`	`58`
`59`	`59`	`## 代码`
`60`	`60`
`61`		`-* 语言支持:JS,C++`
	`61`	`+* 语言支持:JS,C++,Python`
`62`	`62`
`63`	`63`	`JavaScript Code:`
`64`	`64`
`65`	`65`	```js
`66`		`-`
`67`	`66`	`/*`
`68`	`67`	`* @lc app=leetcode id=190 lang=javascript`
`69`	`68`	`*`
`@@ -135,7 +134,9 @@ var reverseBits = function(n) {`
`135`	`134`	`return res >>> 0;`
`136`	`135`	`};`
`137`	`136`	```
	`137`	`+`
`138`	`138`	`C++ Code:`
	`139`	`+`
`139`	`140`	```C++
`140`	`141`	`class Solution {`
`141`	`142`	`public:`
`@@ -149,6 +150,21 @@ public:`
`149`	`150`	`}`
`150`	`151`	`};`
`151`	`152`	```
	`153`	`+`
	`154`	`+Python Code:`
	`155`	`+`
	`156`	+```python
	`157`	`+class Solution:`
	`158`	`+ # @param n, an integer`
	`159`	`+ # @return an integer`
	`160`	`+ def reverseBits(self, n):`
	`161`	`+ result = 0`
	`162`	`+ for i in range(32):`
	`163`	`+ result = (result << 1) + (n & 1)`
	`164`	`+ n >>= 1`
	`165`	`+ return result`
	`166`	+```
	`167`	`+`
`152`	`168`	`## 拓展`
`153`	`169`	`不使用迭代也可以完成相同的操作:`
`154`	`170`	`1. 两两相邻的1位对调`

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit b332699

File tree

1 file changed

1 file changed

`‎problems/190.reverse-bits.md‎`

0 commit comments