-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathpossibleBipartition.js
57 lines (44 loc) · 1.05 KB
/
possibleBipartition.js
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
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
const getDfsFn = (lists, numGroupMap) => {
const dfs = (num, group) => {
if (numGroupMap.has(num)) {
return numGroupMap.get(num) === group
}
numGroupMap.set(num, group)
const dislikes = lists[num] || []
for (let i = 0; i < dislikes.length; i++) {
if (!dfs(dislikes[i], group ^ 1)) {
return false
}
}
return true
}
return dfs
}
const getDislikesLists = (dislikes) => {
const lists = []
for (let i = 0; i < dislikes.length; i++) {
const [a, b] = dislikes[i]
lists[a] = lists[a] || []
lists[a].push(b)
lists[b] = lists[b] || []
lists[b].push(a)
}
return lists
}
/**
* @param {number} N
* @param {number[][]} dislikes
* @return {boolean}
*/
const possibleBipartition = function (N, dislikes) {
const lists = getDislikesLists(dislikes)
const numGroupMap = new Map()
const dfs = getDfsFn(lists, numGroupMap)
for (let i = 1; i <= N; i++) {
if (!numGroupMap.has(i) && !dfs(i, 0)) {
return false
}
}
return true
}
module.exports = possibleBipartition