Class Solution
- java.lang.Object
-
- g0801_0900.s0886_possible_bipartition.Solution
-
public class Solution extends Object
886 - Possible Bipartition.Medium
We want to split a group of
npeople (labeled from1ton) into two groups of any size. Each person may dislike some other people, and they should not go into the same group.Given the integer
nand the arraydislikeswheredislikes[i] = [ai, bi]indicates that the person labeledaidoes not like the person labeledbi, returntrueif 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] and 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 <= 20000 <= dislikes.length <= 104dislikes[i].length == 21 <= dislikes[i][j] <= nai < bi- All the pairs of
dislikesare unique.
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description booleanpossibleBipartition(int n, int[][] dislikes)
-