Commit a85653a

authored

feat: add js solution to lc problem: No.1460 (doocs#3355)

1 parent ccc354f commit a85653aCopy full SHA for a85653a

File tree

+71

-9

lines changed

+71

-9

lines changed

Lines changed: 27 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -128,9 +128,19 @@ func canBeEqual(target []int, arr []int) bool {`
`128`	`128`
`129`	`129`	```ts
`130`	`130`	`function canBeEqual(target: number[], arr: number[]): boolean {`
`131`		`- target.sort((a, b) => a - b);`
`132`		`- arr.sort((a, b) => a - b);`
`133`		`- return target.join() === arr.join();`
	`131`	`+ target.sort();`
	`132`	`+ arr.sort();`
	`133`	`+ return target.every((x, i) => x === arr[i]);`
	`134`	`+}`
	`135`	+```
	`136`	`+`
	`137`	`+#### JavaScript`
	`138`	`+`
	`139`	+```js
	`140`	`+function canBeEqual(target, arr) {`
	`141`	`+ target.sort();`
	`142`	`+ arr.sort();`
	`143`	`+ return target.every((x, i) => x === arr[i]);`
`134`	`144`	`}`
`135`	`145`	```
`136`	`146`
`@@ -273,6 +283,20 @@ function canBeEqual(target: number[], arr: number[]): boolean {`
`273`	`283`	`}`
`274`	`284`	```
`275`	`285`
	`286`	`+#### JavaScript`
	`287`	`+`
	`288`	+```js
	`289`	`+function canBeEqual(target, arr) {`
	`290`	`+ const n = target.length;`
	`291`	`+ const cnt = Array(1001).fill(0);`
	`292`	`+ for (let i = 0; i < n; i++) {`
	`293`	`+ cnt[target[i]]++;`
	`294`	`+ cnt[arr[i]]--;`
	`295`	`+ }`
	`296`	`+ return cnt.every(v => !v);`
	`297`	`+}`
	`298`	+```
	`299`	`+`
`276`	`300`	`#### Rust`
`277`	`301`
`278`	`302`	```rust

Lines changed: 27 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -126,9 +126,19 @@ func canBeEqual(target []int, arr []int) bool {`
`126`	`126`
`127`	`127`	```ts
`128`	`128`	`function canBeEqual(target: number[], arr: number[]): boolean {`
`129`		`- target.sort((a, b) => a - b);`
`130`		`- arr.sort((a, b) => a - b);`
`131`		`- return target.join() === arr.join();`
	`129`	`+ target.sort();`
	`130`	`+ arr.sort();`
	`131`	`+ return target.every((x, i) => x === arr[i]);`
	`132`	`+}`
	`133`	+```
	`134`	`+`
	`135`	`+#### JavaScript`
	`136`	`+`
	`137`	+```js
	`138`	`+function canBeEqual(target, arr) {`
	`139`	`+ target.sort();`
	`140`	`+ arr.sort();`
	`141`	`+ return target.every((x, i) => x === arr[i]);`
`132`	`142`	`}`
`133`	`143`	```
`134`	`144`
`@@ -271,6 +281,20 @@ function canBeEqual(target: number[], arr: number[]): boolean {`
`271`	`281`	`}`
`272`	`282`	```
`273`	`283`
	`284`	`+#### JavaScript`
	`285`	`+`
	`286`	+```js
	`287`	`+function canBeEqual(target, arr) {`
	`288`	`+ const n = target.length;`
	`289`	`+ const cnt = Array(1001).fill(0);`
	`290`	`+ for (let i = 0; i < n; i++) {`
	`291`	`+ cnt[target[i]]++;`
	`292`	`+ cnt[arr[i]]--;`
	`293`	`+ }`
	`294`	`+ return cnt.every(v => !v);`
	`295`	`+}`
	`296`	+```
	`297`	`+`
`274`	`298`	`#### Rust`
`275`	`299`
`276`	`300`	```rust

Lines changed: 5 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,5 @@`
	`1`	`+function canBeEqual(target, arr) {`
	`2`	`+ target.sort();`
	`3`	`+ arr.sort();`
	`4`	`+ return target.every((x, i) => x === arr[i]);`
	`5`	`+}`

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,5 @@`
`1`	`1`	`function canBeEqual(target: number[], arr: number[]): boolean {`
`2`		`- target.sort((a,b)=>a-b);`
`3`		`- arr.sort((a,b)=>a-b);`
`4`		`- return target.join() === arr.join();`
	`2`	`+ target.sort();`
	`3`	`+ arr.sort();`
	`4`	`+ return target.every((x,i) =>x=== arr[i]);`
`5`	`5`	`}`

Lines changed: 9 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,9 @@`
	`1`	`+function canBeEqual(target, arr) {`
	`2`	`+ const n = target.length;`
	`3`	`+ const cnt = Array(1001).fill(0);`
	`4`	`+ for (let i = 0; i < n; i++) {`
	`5`	`+ cnt[target[i]]++;`
	`6`	`+ cnt[arr[i]]--;`
	`7`	`+ }`
	`8`	`+ return cnt.every(v => !v);`
	`9`	`+}`

Comments

(0)