LeetCode-785. Is Graph Bipartite? [C++][Java]

LeetCode-785. Is Graph Bipartite?Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.https://leetcode.com/problems/is-graph-bipartite/

There is an undirected graph with n nodes, where each node is numbered between 0 and n - 1. You are given a 2D array graph, where graph[u] is an array of nodes that node u is adjacent to. More formally, for each v in graph[u], there is an undirected edge between node u and node v. The graph has the following properties:

• There are no self-edges (graph[u] does not contain u).
• There are no parallel edges (graph[u] does not contain duplicate values).
• If v is in graph[u], then u is in graph[v] (the graph is undirected).
• The graph may not be connected, meaning there may be two nodes u and v such that there is no path between them.

A graph is bipartite if the nodes can be partitioned into two independent sets A and B such that every edge in the graph connects a node in set A and a node in set B.

Return true if and only if it is bipartite.

Example 1:

Input: graph = [[1,2,3],[0,2],[0,1,3],[0,2]]
Output: false
Explanation: There is no way to partition the nodes into two independent sets such that every edge connects a node in one and a node in the other.

Example 2:

Input: graph = [[1,3],[0,2],[1,3],[0,2]]
Output: true
Explanation: We can partition the nodes into two sets: {0, 2} and {1, 3}.

Constraints:

• graph.length == n
• 1 <= n <= 100
• 0 <= graph[u].length < n
• 0 <= graph[u][i] <= n - 1
• graph[u] does not contain u.
• All the values of graph[u] are unique.
• If graph[u] contains v, then graph[v] contains u.

【C++】

1. 循环

class Solution {
public:
    bool isBipartite(vector<vector<int>>& graph) {
        int n = graph.size();
        if (n == 0) {return true;}
        vector<int> color(n);
        queue<int> q;
        for (int i = 0; i < n; i++) {
            if (color[i] == 0) {
                color[i] = 1;
                q.push(i);
            }
            while (!q.empty()) {
                int cur = q.front();
                q.pop();
                for (int next : graph[cur]) {
                    if (color[next] == 0) {
                        color[next] = -color[cur];
                        q.push(next);
                    } else if (color[next] == color[cur]) {
                        return false;
                    }
                }
            }
        }
        return true;
    }
};

2. 递归

class Solution {
public:
    vector<int> m;
    bool isBipartite(vector<vector<int>>& graph) {        
        m.resize(graph.size());
        for(int i = 0; i < m.size(); ++i) { 
            if(m[i] == 0 && !dfs(graph, i, 1)) {return false;}
        }
        return true;
    }
    
    bool dfs(vector<vector<int>>& graph, int i, int c) {
        if(m[i]) {return m[i] == c;}
        m[i] = c;
        for (auto &next : graph[i]) {
            if(!dfs(graph, next, -c)) {return false;}
        }
        return true;
    }
};

【Java】

1. 循环

class Solution {
    public boolean isBipartite(int[][] graph) {
        int n = graph.length;
        if (n == 0) {return true;}
        int[] color = new int[n];
        Queue<Integer> q = new LinkedList<>();
        for (int i = 0; i < n; i++) {
            if (color[i] == 0) {
                color[i] = 1;
                q.offer(i);
            }
            while (!q.isEmpty()) {
                int cur = q.poll();
                for (int next : graph[cur]) {
                    if (color[next] == 0) {
                        color[next] = -color[cur];
                        q.offer(next);
                    } else if (color[next] == color[cur]) {
                        return false;
                    }
                }
            }
        }
        return true;
    }
}

2. 递归

class Solution {
    private int[] color;
    public boolean isBipartite(int[][] graph) {
        int n = graph.length;
        if (n == 0) {return true;}
        color = new int[n];
        for (int i = 0; i < n; i++) {
            if (color[i] == 0 && !dfs(graph, i, 1)) {
                return false;
            }
        }
        return true;
    }
    
    private boolean dfs(int[][] graph, int i, int c) {
        if (color[i] != 0) {return color[i] == c;}
        color[i] = c;
        for (int next : graph[i]) {
            if (!dfs(graph, next, -c)) {return false;}
        }
        return true;
    }
}

参考文献

【1】二分图例题_荼白777的博客-CSDN博客