forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathhsskey.js
More file actions
38 lines (30 loc) · 789 Bytes
/
hsskey.js
File metadata and controls
38 lines (30 loc) · 789 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
export class Solution {
/**
* @param {number} n - number of nodes
* @param {number[][]} edges - undirected edges
* @return {boolean}
*/
validTree(n, edges) {
if (n === 0) return true;
// 인접 리스트 생성
const adj = {};
for (let i = 0; i < n; i++) {
adj[i] = [];
}
for (const [n1, n2] of edges) {
adj[n1].push(n2);
adj[n2].push(n1);
}
const visit = new Set();
const dfs = (i, prev) => {
if (visit.has(i)) return false;
visit.add(i);
for (const j of adj[i]) {
if (j === prev) continue;
if (!dfs(j, i)) return false;
}
return true;
};
return dfs(0, -1) && visit.size === n;
}
}