Package g0801_0900.s0886_possible_bipartition

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    886 - Possible Bipartition.

    Medium

    We want to split a group of n people (labeled from 1 to n) 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 n and the array dislikes where <code>dislikesi = a<sub>i</sub>, b<sub>i</sub></code> indicates that the person labeled <code>a<sub>i</sub></code> does not like the person labeled <code>b<sub>i</sub></code>, return true 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: The first group has 1,4, and the second group has 2,3.

    Example 2:

    Input: n = 3, dislikes = \[\[1,2],1,3,2,3]

    Output: false

    Explanation: We need at least 3 groups to divide them. We cannot put them in two groups.

    Constraints:

    • 1 &lt;= n &lt;= 2000

    • <code>0 <= dislikes.length <= 10<sup>4</sup></code>

    • dislikes[i].length == 2

    • <code>1 <= a<sub>i</sub>< b<sub>i</sub><= n</code>

    • All the pairs of dislikes are unique.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Boolean possibleBipartition(Integer n, Array<IntArray> dislikes)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait