Commit a0f8841

authored

feat: update ts solution to lc problem: No.1481 (doocs#3191)

1 parent f5031fc commit a0f8841Copy full SHA for a0f8841

File tree

+12

-18

lines changed

+12

-18

lines changed

Lines changed: 4 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -160,13 +160,11 @@ func findLeastNumOfUniqueInts(arr []int, k int) int {`
`160`	`160`	`function findLeastNumOfUniqueInts(arr: number[], k: number): number {`
`161`	`161`	`const cnt: Map<number, number> = new Map();`
`162`	`162`	`for (const x of arr) {`
`163`		`- cnt.set(x, (cnt.get(x) \|\| 0) + 1);`
	`163`	`+ cnt.set(x, (cnt.get(x) ?? 0) + 1);`
`164`	`164`	`}`
`165`		`- const nums: number[] = [];`
`166`		`- for (const [_, v] of cnt) {`
`167`		`- nums.push(v);`
`168`		`- }`
`169`		`- nums.sort((a, b) => a - b);`
	`165`	`+`
	`166`	`+ const nums = [...cnt.values()].sort((a, b) => a - b);`
	`167`	`+`
`170`	`168`	`for (let i = 0; i < nums.length; ++i) {`
`171`	`169`	`k -= nums[i];`
`172`	`170`	`if (k < 0) {`

Lines changed: 4 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -174,13 +174,11 @@ func findLeastNumOfUniqueInts(arr []int, k int) int {`
`174`	`174`	`function findLeastNumOfUniqueInts(arr: number[], k: number): number {`
`175`	`175`	`const cnt: Map<number, number> = new Map();`
`176`	`176`	`for (const x of arr) {`
`177`		`- cnt.set(x, (cnt.get(x) \|\| 0) + 1);`
	`177`	`+ cnt.set(x, (cnt.get(x) ?? 0) + 1);`
`178`	`178`	`}`
`179`		`- const nums: number[] = [];`
`180`		`- for (const [_, v] of cnt) {`
`181`		`- nums.push(v);`
`182`		`- }`
`183`		`- nums.sort((a, b) => a - b);`
	`179`	`+`
	`180`	`+ const nums = [...cnt.values()].sort((a, b) => a - b);`
	`181`	`+`
`184`	`182`	`for (let i = 0; i < nums.length; ++i) {`
`185`	`183`	`k -= nums[i];`
`186`	`184`	`if (k < 0) {`

Lines changed: 4 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,13 +1,11 @@`
`1`	`1`	`function findLeastNumOfUniqueInts(arr: number[], k: number): number {`
`2`	`2`	`const cnt: Map<number, number> = new Map();`
`3`	`3`	`for (const x of arr) {`
`4`		`- cnt.set(x, (cnt.get(x) \|\| 0) + 1);`
	`4`	`+ cnt.set(x, (cnt.get(x) ?? 0) + 1);`
`5`	`5`	`}`
`6`		`- const nums: number[] = [];`
`7`		`- for (const [_, v] of cnt) {`
`8`		`- nums.push(v);`
`9`		`- }`
`10`		`- nums.sort((a, b) => a - b);`
	`6`	`+`
	`7`	`+ const nums = [...cnt.values()].sort((a, b) => a - b);`
	`8`	`+`
`11`	`9`	`for (let i = 0; i < nums.length; ++i) {`
`12`	`10`	`k -= nums[i];`
`13`	`11`	`if (k < 0) {`

Comments

(0)