-
Notifications
You must be signed in to change notification settings - Fork 0
/
Day-27_Possible_Bipartition.py
64 lines (46 loc) · 1.74 KB
/
Day-27_Possible_Bipartition.py
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
58
59
60
61
62
63
64
'''
Given a set of N people (numbered 1, 2, ..., N), we would like to split everyone into two groups of any size.
Each person may dislike some other people, and they should not go into the same group.
Formally, if dislikes[i] = [a, b], it means it is not allowed to put the people numbered a and b into the same group.
Return true if and only if it is possible to split everyone into two groups in this way.
Example 1:
Input: N = 4, dislikes = [[1,2],[1,3],[2,4]]
Output: true
Explanation: group1 [1,4], group2 [2,3]
Example 2:
Input: N = 3, dislikes = [[1,2],[1,3],[2,3]]
Output: false
Example 3:
Input: N = 5, dislikes = [[1,2],[2,3],[3,4],[4,5],[1,5]]
Output: false
Note:
1 <= N <= 2000
0 <= dislikes.length <= 10000
1 <= dislikes[i][j] <= N
dislikes[i][0] < dislikes[i][1]
There does not exist i != j for which dislikes[i] == dislikes[j].
'''
class Solution:
def possibleBipartition(self, N: int, dislikes: List[List[int]]) -> bool:
def dfs(i: int) -> bool:
for j in graph[i]:
if j in color:
if color[j] != 1 - color[i]:
return False
else:
color[j] = 1 - color[i]
if not dfs(j):
return False
return True
graph = collections.defaultdict(list)
for u, v in dislikes:
# add both ends of an edge to the adjacency list
graph[u].append(v)
graph[v].append(u)
color = {}
for i in graph:
if i not in color:
color[i] = 0
if not dfs(i):
return False
return True