(int n, int[][] paths)
| 1 | class Solution { |
| 2 | public int[] gardenNoAdj(int n, int[][] paths) { |
| 3 | int output[] = new int[n]; |
| 4 | boolean ans=backtrack(1,paths,output,n+1); |
| 5 | return output; |
| 6 | } |
| 7 | |
| 8 | public boolean backtrack(int garden,int path[][], int output[],int n) |
| 9 | { |