Commit 74f5b43

authored

feat: add solutions to lc problem: No.1356 (doocs#626)

No.1356.Sort Integers by The Number of 1 Bits

1 parent c65ee2f commit 74f5b43Copy full SHA for 74f5b43

File tree

+51

-4

lines changed

+51

-4

lines changed

Lines changed: 17 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -71,15 +71,30 @@`
`71`	`71`	`<!-- 这里可写当前语言的特殊实现逻辑 -->`
`72`	`72`
`73`	`73`	```python
`74`		`-`
	`74`	`+class Solution:`
	`75`	`+ def sortByBits(self, arr: List[int]) -> List[int]:`
	`76`	`+ arr.sort(key=lambda x: (bin(x).count("1"), x))`
	`77`	`+ return arr`
`75`	`78`	```
`76`	`79`
`77`	`80`	`### Java`
`78`	`81`
`79`	`82`	`<!-- 这里可写当前语言的特殊实现逻辑 -->`
`80`	`83`
`81`	`84`	```java
`82`		`-`
	`85`	`+class Solution {`
	`86`	`+ public int[] sortByBits(int[] arr) {`
	`87`	`+ int n = arr.length;`
	`88`	`+ for (int i = 0; i < n; i++) {`
	`89`	`+ arr[i] += Integer.bitCount(arr[i]) * 100000;`
	`90`	`+ }`
	`91`	`+ Arrays.sort(arr);`
	`92`	`+ for (int i = 0; i < n; i++) {`
	`93`	`+ arr[i] %= 100000;`
	`94`	`+ }`
	`95`	`+ return arr;`
	`96`	`+ }`
	`97`	`+}`
`83`	`98`	```
`84`	`99`
`85`	`100`	`### ...`

Lines changed: 17 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -66,13 +66,28 @@ The sorted array by bits is [0,1,2,4,8,3,5,6,7]`
`66`	`66`	`### Python3`
`67`	`67`
`68`	`68`	```python
`69`		`-`
	`69`	`+class Solution:`
	`70`	`+ def sortByBits(self, arr: List[int]) -> List[int]:`
	`71`	`+ arr.sort(key=lambda x: (bin(x).count("1"), x))`
	`72`	`+ return arr`
`70`	`73`	```
`71`	`74`
`72`	`75`	`### Java`
`73`	`76`
`74`	`77`	```java
`75`		`-`
	`78`	`+class Solution {`
	`79`	`+ public int[] sortByBits(int[] arr) {`
	`80`	`+ int n = arr.length;`
	`81`	`+ for (int i = 0; i < n; i++) {`
	`82`	`+ arr[i] += Integer.bitCount(arr[i]) * 100000;`
	`83`	`+ }`
	`84`	`+ Arrays.sort(arr);`
	`85`	`+ for (int i = 0; i < n; i++) {`
	`86`	`+ arr[i] %= 100000;`
	`87`	`+ }`
	`88`	`+ return arr;`
	`89`	`+ }`
	`90`	`+}`
`76`	`91`	```
`77`	`92`
`78`	`93`	`### ...`

Lines changed: 13 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,13 @@`
	`1`	`+class Solution {`
	`2`	`+ public int[] sortByBits(int[] arr) {`
	`3`	`+ int n = arr.length;`
	`4`	`+ for (int i = 0; i < n; i++) {`
	`5`	`+ arr[i] += Integer.bitCount(arr[i]) * 100000;`
	`6`	`+ }`
	`7`	`+ Arrays.sort(arr);`
	`8`	`+ for (int i = 0; i < n; i++) {`
	`9`	`+ arr[i] %= 100000;`
	`10`	`+ }`
	`11`	`+ return arr;`
	`12`	`+ }`
	`13`	`+}`

Lines changed: 4 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,4 @@`
	`1`	`+class Solution:`
	`2`	`+ def sortByBits(self, arr: List[int]) -> List[int]:`
	`3`	`+ arr.sort(key=lambda x: (bin(x).count("1"), x))`
	`4`	`+ return arr`

Comments

(0)