Commit f47bcdb

authored

refactor: update ts solution to lc problem: No.323 (doocs#2992)

1 parent 88a131a commit f47bcdbCopy full SHA for f47bcdb

File tree

+42

-48

lines changed

+42

-48

lines changed

Lines changed: 14 additions & 16 deletions

Original file line number	Diff line number	Diff line change
`@@ -643,29 +643,27 @@ func countComponents(n int, edges [][]int) (ans int) {`
`643`	`643`
`644`	`644`	```ts
`645`	`645`	`function countComponents(n: number, edges: number[][]): number {`
`646`		`- const g: number[][] = Array.from({ length: n }, () => []);`
	`646`	`+ const g: Map<number, number[]> = newMap(Array.from({ length: n }, (_, i) => [i, []]));`
`647`	`647`	`for (const [a, b] of edges) {`
`648`		`- g[a].push(b);`
`649`		`- g[b].push(a);`
	`648`	`+ g.get(a)!.push(b);`
	`649`	`+ g.get(b)!.push(a);`
`650`	`650`	`}`
`651`		`- const vis: boolean[] = Array(n).fill(false);`
	`651`	`+`
	`652`	`+ const vis = new Set<number>();`
`652`	`653`	`let ans = 0;`
`653`		`- for (let i =0; i<n; ++i) {`
`654`		`- if (vis[i]) {`
	`654`	`+ for (const [i] ofg) {`
	`655`	`+ if (vis.has(i)) {`
`655`	`656`	`continue;`
`656`	`657`	`}`
`657`		`- vis[i] = true;`
`658`		`- ++ans;`
`659`		`- const q: number[] = [i];`
`660`		`- while (q.length) {`
`661`		`- const a = q.pop()!;`
`662`		`- for (const b of g[a]) {`
`663`		`- if (!vis[b]) {`
`664`		`- vis[b] = true;`
`665`		`- q.push(b);`
`666`		`- }`
	`658`	`+ const q = [i];`
	`659`	`+ for (const j of q) {`
	`660`	`+ if (vis.has(j)) {`
	`661`	`+ continue;`
`667`	`662`	`}`
	`663`	`+ vis.add(j);`
	`664`	`+ q.push(...g.get(j)!);`
`668`	`665`	`}`
	`666`	`+ ans++;`
`669`	`667`	`}`
`670`	`668`	`return ans;`
`671`	`669`	`}`

Lines changed: 14 additions & 16 deletions

Original file line number	Diff line number	Diff line change
`@@ -638,29 +638,27 @@ func countComponents(n int, edges [][]int) (ans int) {`
`638`	`638`
`639`	`639`	```ts
`640`	`640`	`function countComponents(n: number, edges: number[][]): number {`
`641`		`- const g: number[][] = Array.from({ length: n }, () => []);`
	`641`	`+ const g: Map<number, number[]> = newMap(Array.from({ length: n }, (_, i) => [i, []]));`
`642`	`642`	`for (const [a, b] of edges) {`
`643`		`- g[a].push(b);`
`644`		`- g[b].push(a);`
	`643`	`+ g.get(a)!.push(b);`
	`644`	`+ g.get(b)!.push(a);`
`645`	`645`	`}`
`646`		`- const vis: boolean[] = Array(n).fill(false);`
	`646`	`+`
	`647`	`+ const vis = new Set<number>();`
`647`	`648`	`let ans = 0;`
`648`		`- for (let i =0; i<n; ++i) {`
`649`		`- if (vis[i]) {`
	`649`	`+ for (const [i] ofg) {`
	`650`	`+ if (vis.has(i)) {`
`650`	`651`	`continue;`
`651`	`652`	`}`
`652`		`- vis[i] = true;`
`653`		`- ++ans;`
`654`		`- const q: number[] = [i];`
`655`		`- while (q.length) {`
`656`		`- const a = q.pop()!;`
`657`		`- for (const b of g[a]) {`
`658`		`- if (!vis[b]) {`
`659`		`- vis[b] = true;`
`660`		`- q.push(b);`
`661`		`- }`
	`653`	`+ const q = [i];`
	`654`	`+ for (const j of q) {`
	`655`	`+ if (vis.has(j)) {`
	`656`	`+ continue;`
`662`	`657`	`}`
	`658`	`+ vis.add(j);`
	`659`	`+ q.push(...g.get(j)!);`
`663`	`660`	`}`
	`661`	`+ ans++;`
`664`	`662`	`}`
`665`	`663`	`return ans;`
`666`	`664`	`}`

Lines changed: 14 additions & 16 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,27 +1,25 @@`
`1`	`1`	`function countComponents(n: number, edges: number[][]): number {`
`2`		`- const g: number[][] = Array.from({ length: n }, () => []);`
	`2`	`+ const g: Map<number,number[]> = newMap(Array.from({ length: n }, (_,i) => [i,[]]));`
`3`	`3`	`for (const [a, b] of edges) {`
`4`		`- g[a].push(b);`
`5`		`- g[b].push(a);`
	`4`	`+ g.get(a)!.push(b);`
	`5`	`+ g.get(b)!.push(a);`
`6`	`6`	`}`
`7`		`- const vis: boolean[] = Array(n).fill(false);`
	`7`	`+`
	`8`	`+ const vis = new Set<number>();`
`8`	`9`	`let ans = 0;`
`9`		`- for (leti=0;i<n;++i) {`
`10`		`- if (vis[i]) {`
	`10`	`+ for (const[i]ofg) {`
	`11`	`+ if (vis.has(i)) {`
`11`	`12`	`continue;`
`12`	`13`	`}`
`13`		`- vis[i] = true;`
`14`		`- ++ans;`
`15`		`- const q: number[] = [i];`
`16`		`- while (q.length) {`
`17`		`- const a = q.pop()!;`
`18`		`- for (const b of g[a]) {`
`19`		`- if (!vis[b]) {`
`20`		`- vis[b] = true;`
`21`		`- q.push(b);`
`22`		`- }`
	`14`	`+ const q = [i];`
	`15`	`+ for (const j of q) {`
	`16`	`+ if (vis.has(j)) {`
	`17`	`+ continue;`
`23`	`18`	`}`
	`19`	`+ vis.add(j);`
	`20`	`+ q.push(...g.get(j)!);`
`24`	`21`	`}`
	`22`	`+ ans++;`
`25`	`23`	`}`
`26`	`24`	`return ans;`
`27`	`25`	`}`

Comments

(0)