Formatted question description: https://leetcode.ca/all/886.html

886. Possible Bipartition (Medium)

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].

Related Topics:
Depth-first Search

Solution 1. DFS

// OJ: https://leetcode.com/problems/possible-bipartition/
// Time: O(V + E)
// Space: O(V + E)
class Solution {
    vector<unordered_set<int>> G;
    vector<int> id;
    bool dfs(int u, int prev = 1) {
        if (id[u]) return id[u] != prev;
        id[u] = -prev;
        for (int v : G[u]) {
            if (!dfs(v, id[u])) return false;
        }
        return true;
    }
public:
    bool possibleBipartition(int N, vector<vector<int>>& A) {
        G.assign(N + 1, {});
        id.assign(N + 1, 0);
        for (auto &v : A) {
            G[v[0]].insert(v[1]);
            G[v[1]].insert(v[0]);
        }
        for (int i = 1; i <= N; ++i) {
            if (id[i]) continue;
            if (!dfs(i)) return false;
        }
        return true;
    }
};

Solution 2. BFS

// OJ: https://leetcode.com/problems/possible-bipartition/
// Time: O(V + E)
// Space: O(V + E)
class Solution {
public:
    bool possibleBipartition(int N, vector<vector<int>>& A) {
        vector<vector<int>> G(N + 1);
        vector<int> id(N + 1, 0);
        for (auto &v : A) {
            G[v[0]].push_back(v[1]);
            G[v[1]].push_back(v[0]);
        }
        queue<int> q;
        for (int i = 1; i <= N; ++i) {
            if (id[i]) continue;
            q.push(i);
            id[i] = 1;
            while (q.size()) {
                int u = q.front();
                q.pop();
                for (int v : G[u]) {
                    if (id[v]) {
                        if (id[v] != -id[u]) return false;
                        else continue;
                    }
                    id[v] = -id[u];
                    q.push(v);
                }
            }
        }
        return true;
    }
};

Java

  • class Solution {
        public boolean possibleBipartition(int N, int[][] dislikes) {
            int[] degrees = new int[N];
            Map<Integer, Set<Integer>> dislikesMap = new HashMap<Integer, Set<Integer>>();
            for (int[] dislike : dislikes) {
                int person1 = dislike[0] - 1, person2 = dislike[1] - 1;
                degrees[person1]++;
                degrees[person2]++;
                Set<Integer> dislikesSet1 = dislikesMap.getOrDefault(person1, new HashSet<Integer>());
                Set<Integer> dislikesSet2 = dislikesMap.getOrDefault(person2, new HashSet<Integer>());
                dislikesSet1.add(person2);
                dislikesSet2.add(person1);
                dislikesMap.put(person1, dislikesSet1);
                dislikesMap.put(person2, dislikesSet2);
            }
            int[] groups = new int[N];
            for (int i = 0; i < N; i++) {
                if (degrees[i] > 0 && groups[i] == 0) {
                    groups[i] = 1;
                    boolean possible = breadthFirstSearch(dislikesMap, groups, i);
                    if (!possible)
                        return false;
                }
            }
            return true;
        }
    
        public boolean breadthFirstSearch(Map<Integer, Set<Integer>> dislikesMap, int[] groups, int start) {
            Queue<Integer> queue = new LinkedList<Integer>();
            queue.offer(start);
            while (!queue.isEmpty()) {
                int person = queue.poll();
                int group = groups[person];
                int newGroup = 3 - group;
                Set<Integer> dislikes = dislikesMap.getOrDefault(person, new HashSet<Integer>());
                for (int dislike : dislikes) {
                    if (groups[dislike] == group)
                        return false;
                    else if (groups[dislike] == 0) {
                        groups[dislike] = newGroup;
                        queue.offer(dislike);
                    }
                }
            }
            return true;
        }
    }
    
  • // OJ: https://leetcode.com/problems/possible-bipartition/
    // Time: O(V + E)
    // Space: O(V + E)
    class Solution {
        vector<unordered_set<int>> G;
        vector<int> id;
        bool dfs(int u, int prev = 1) {
            if (id[u]) return id[u] != prev;
            id[u] = -prev;
            for (int v : G[u]) {
                if (!dfs(v, id[u])) return false;
            }
            return true;
        }
    public:
        bool possibleBipartition(int N, vector<vector<int>>& A) {
            G.assign(N + 1, {});
            id.assign(N + 1, 0);
            for (auto &v : A) {
                G[v[0]].insert(v[1]);
                G[v[1]].insert(v[0]);
            }
            for (int i = 1; i <= N; ++i) {
                if (id[i]) continue;
                if (!dfs(i)) return false;
            }
            return true;
        }
    };
    
  • class Solution(object):
        def possibleBipartition(self, N, dislikes):
            """
            :type N: int
            :type dislikes: List[List[int]]
            :rtype: bool
            """
            graph = collections.defaultdict(list)
            for dislike in dislikes:
                graph[dislike[0] - 1].append(dislike[1] - 1)
                graph[dislike[1] - 1].append(dislike[0] - 1)
            color = [0] * N
            for i in range(N):
                if color[i] != 0: continue
                bfs = collections.deque()
                bfs.append(i)
                color[i] = 1
                while bfs:
                    cur = bfs.popleft()
                    for e in graph[cur]:
                        if color[e] != 0:
                            if color[cur] == color[e]:
                                return False
                        else:
                            color[e] = -color[cur]
                            bfs.append(e)
            return True
    

All Problems

All Solutions