[leetcode] 886. Possible Bipartition

Description

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

Constraints:

• 1 <= N <= 2000
• 0 <= dislikes.length <= 10000
• dislikes[i].length == 2
• 1 <= dislikes[i][j] <= N
• dislikes[i][0] < dislikes[i][1]
• There does not exist i != j for which dislikes[i] == dislikes[j].

分析

题目的意思是：判断一个图是否分成不相邻的子集，其实就是判断一个图是否是二分，这样的话可以用填充颜色的方法，把两个相邻的节点填充为不同的颜色，如果有冲突，则不能二分；否则能够二分。

• 这里需要用到深度优先搜索，首先把dislikes构成一张图，然后colors记录被填充的节点。
• 递归的终止条件是，如果当前的节点已经被填充，看它是否和将要被填充的颜色相同，即colors[node]==c
• 接下来就是遍历当前节点的邻居节点了哈，对邻居节点填充不同的颜色，然后进行递归判断就行了

代码

class Solution:
    def dfs(self,graph,node,c):
        if(node in self.colors):
            return self.colors[node]==c
        self.colors[node]=c
        for nei in graph[node]:
            if(self.dfs(graph,nei,1-c)==False):
                return False
        return True
        
    def possibleBipartition(self, N: int, dislikes: List[List[int]]) -> bool:
        graph=collections.defaultdict(list)
        for u,v in dislikes:
            graph[u].append(v)
            graph[v].append(u)
        self.colors={}
        for node in range(1,N+1):
            if(node not in self.colors):
                if(self.dfs(graph,node,0)==False):
                    return False
        return True

参考文献

solution