Flower Planting With No Adjacent LeetCode solution in Java

1
class Solution {
2
  public int[] gardenNoAdj(int n, int[][] paths) {
3
    boolean[][] graph = new boolean[n][n];
4
    for (int i = 0; i < paths.length; i++) {
5
      int u = paths[i][0] - 1;
6
      int v = paths[i][1] - 1;
7
      graph[u][v] = true;
8
      graph[v][u] = true;
9
    }
10
    int[] colored = new int[n];
11
    boolean[] available = new boolean[4];
12
    Arrays.fill(colored, -1);
13
    colored[0] = 1;
14
    for (int i = 1; i < n; i++) {
15
      for (int j = 0; j < n; j++) {
16
        if (graph[i][j] && colored[j] != -1) {
17
          available[colored[j] - 1] = true;
18
        }
19
      }
20
      int k, flag = 0;
21
      for (k = 0; k < 4; k++) {
22
        if (available[k] == false) {
23
          flag = 1;
24
          break;
25
        }
26
      }
27
      colored[i] = k + 1;
28
      Arrays.fill(available, false);
29
    }
30
    return colored;
31
  }
32
}