g0701_0800.s0785_is_graph_bipartite.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.37

package g0701_0800.s0785_is_graph_bipartite;

// #Medium #Depth_First_Search #Breadth_First_Search #Graph #Union_Find

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

    private boolean helper(int[][] graph, int curr, int c, int[] color) {
        if (color[curr] == c) {
            return true;
        }
        color[curr] = c;
        for (int x : graph[curr]) {
            if (color[x] == c || !helper(graph, x, c * -1, color)) {
                return false;
            }
        }
        return true;
    }
}