Leetcode May Challenge - 05/27: Possible Bipartition(Python)

题目描述

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

解释

给出一个正整数N，表示N个人，一个数组dislikes，里面的每个元素都是一个键值对[i, j]，表示i和j两个人互相讨厌。现在我们要把这些人分为两组，要求互相讨厌的两个人不能分在同一组。求是否有这样的分组方法。

思路 广度优先搜索BFS

首先一看这道题给的条件，我们直观上来讲比较方便的表示dislikes就是把他转化成无向图。然后我们对图进行BFS，用1和-1表示两种颜色，相邻的点不能涂成同一种颜色。如果BFS能成功进行到最后，则意味着可以分成两组。否则意味着不能。

代码

class Solution(object):
    def possibleBipartition(self, N, dislikes):
        """
        :type N: int
        :type dislikes: List[List[int]]
        :rtype: bool
        """
        import collections
        graph = collections.defaultdict(list)
        for i, j in dislikes:
            graph[i].append(j)
            graph[j].append(i)
            
        q = []
        color = [0] * (N + 1)
        for i in range(1, N + 1):
            if color[i] != 0:
                continue
            q.append(i)
            color[i] = 1
            while q:
                cur_person = q.pop(0)
                for others in graph[cur_person]:
                    if color[others] and color[others] == color[cur_person]:
                        return False
                    if not color[others]:
                        color[others] = -color[cur_person]
                        q.append(others)
        return True