LeetCode周赛97 890. Possible Bipartition C++ [自己开发的博客网站，欢迎访问](www.weiboke.online) www.weiboke.online

自己开发的博客网站，欢迎访问 www.weiboke.online

890. Possible Bipartition

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. 1 <= N <= 2000
2. 0 <= dislikes.length <= 10000
3. 1 <= dislikes[i][j] <= N
4. dislikes[i][0] < dislikes[i][1]
5. There does not exist i != j for which dislikes[i] == dislikes[j].

##Approach

1. 给一个人数N，并且给你一组哪两个人不能为一组的清单，问你是否能分成两组，这道题貌似是找朋友组队，其实当你把图画出来的时候，你会发现能组成两组的图很像一个二分图，所以这道题就变成了求解是否是二分图了，然后也就可以用染色法处理这道题。
2. 染色法：只用两种颜色表示，与自己相连的，涂成与自己不一样的另一种颜色，如果已经涂色，与自己颜色相同，那么不是二分图，与自己颜色不同则继续判断，直至全部涂完。

Code

class Solution {
public:
	bool possibleBipartition(int N, vector<vector<int>>& dislikes) {
		if (dislikes.size() == 0)return true;
		vector<vector<int>>graph(N + 1);
		for (auto &dis : dislikes) {
			graph[dis[0]].push_back(dis[1]);
			graph[dis[1]].push_back(dis[0]);
		}
		vector<int>color(N+1, -1);
		for (int i = 1; i <= N; i++) {
			if (color[i] == -1 && !DFS(graph, color, i, 1)) return false;
		}
		return true;
	}
	bool DFS(vector<vector<int>>&graph, vector<int>&color, int node, int C) {
		if (color[node] != -1) {
			return color[node] == C;
		}
		color[node] = C;
		for (auto &v : graph[node]) {
			if (!DFS(graph, color, v, 1 - C)) {
				return false;
			}
		}
		return true;
	}
};