git

Author: walkccc

STYLEGUIDE.md

@@ -466,9 +466,7 @@ across different programming languages while adhering to LeetCode's conventions.
 
     ```java
     List<Integer>[] graph = new List[n];
-
-    for (int i = 0; i < n; ++i)
-      graph[i] = new ArrayList<>();
+    Arrays.setAll(graph, i -> new ArrayList<>());
 
     for (int[] edge : edges) {
       final int u = edge[0];

solutions/1042. Flower Planting With No Adjacent/1042.java

@@ -2,9 +2,7 @@ class Solution {
   public int[] gardenNoAdj(int n, int[][] paths) {
     int[] ans = new int[n]; // ans[i] := 1, 2, 3, or 4
     List<Integer>[] graph = new List[n];
-
-    for (int i = 0; i < n; ++i)
-      graph[i] = new ArrayList<>();
+    Arrays.setAll(graph, i -> new ArrayList<>());
 
     for (int[] path : paths) {
       final int u = path[0] - 1;

solutions/1059. All Paths from Source Lead to Destination/1059.java

@@ -4,9 +4,7 @@ class Solution {
   public boolean leadsToDestination(int n, int[][] edges, int source, int destination) {
     List<Integer>[] graph = new List[n];
     State[] states = new State[n];
-
-    for (int i = 0; i < n; ++i)
-      graph[i] = new ArrayList<>();
+    Arrays.setAll(graph, i -> new ArrayList<>());
 
     for (int[] edge : edges) {
       final int u = edge[0];

solutions/1129. Shortest Path with Alternating Colors/1129.java

@@ -8,9 +8,7 @@ public int[] shortestAlternatingPaths(int n, int[][] redEdges, int[][] blueEdges
     List<Pair<Integer, Color>>[] graph = new List[n];
     // [(u, prevColor)]
     Queue<Pair<Integer, Color>> q = new ArrayDeque<>(List.of(new Pair<>(0, Color.INIT)));
-
-    for (int i = 0; i < n; ++i)
-      graph[i] = new ArrayList<>();
+    Arrays.setAll(graph, i -> new ArrayList<>());
 
     for (int[] edge : redEdges) {
       final int u = edge[0];

solutions/1136. Parallel Courses/1136-2.java

@@ -2,9 +2,7 @@ class Solution {
   public int minimumSemesters(int n, int[][] relations) {
     List<Integer>[] graph = new List[n];
     int[] inDegrees = new int[n];
-
-    for (int i = 0; i < n; ++i)
-      graph[i] = new ArrayList<>();
+    Arrays.setAll(graph, i -> new ArrayList<>());
 
     // Build the graph.
     for (int[] relation : relations) {

solutions/1136. Parallel Courses/1136.java

@@ -6,9 +6,7 @@ public int minimumSemesters(int n, int[][] relations) {
     State[] states = new State[n];
     int[] depth = new int[n];
     Arrays.fill(depth, 1);
-
-    for (int i = 0; i < n; ++i)
-      graph[i] = new ArrayList<>();
+    Arrays.setAll(graph, i -> new ArrayList<>());
 
     for (int[] relation : relations) {
       final int u = relation[0] - 1;

solutions/1192. Critical Connections in a Network/1192.java

@@ -2,9 +2,7 @@ class Solution {
   public List<List<Integer>> criticalConnections(int n, List<List<Integer>> connections) {
     List<List<Integer>> ans = new ArrayList<>();
     List<Integer>[] graph = new List[n];
-
-    for (int i = 0; i < n; ++i)
-      graph[i] = new ArrayList<>();
+    Arrays.setAll(graph, i -> new ArrayList<>());
 
     for (List<Integer> connection : connections) {
       final int u = connection.get(0);

solutions/1319. Number of Operations to Make Network Connected/1319.java

@@ -7,9 +7,7 @@ public int makeConnected(int n, int[][] connections) {
     int numOfConnected = 0;
     List<Integer>[] graph = new List[n];
     Set<Integer> seen = new HashSet<>();
-
-    for (int i = 0; i < n; ++i)
-      graph[i] = new ArrayList<>();
+    Arrays.setAll(graph, i -> new ArrayList<>());
 
     for (int[] connection : connections) {
       final int u = connection[0];

solutions/1443. Minimum Time to Collect All Apples in a Tree/1443.java

@@ -1,9 +1,7 @@
 class Solution {
   public int minTime(int n, int[][] edges, List<Boolean> hasApple) {
     List<Integer>[] graph = new List[n];
-
-    for (int i = 0; i < n; ++i)
-      graph[i] = new ArrayList<>();
+    Arrays.setAll(graph, i -> new ArrayList<>());
 
     for (int[] edge : edges) {
       final int u = edge[0];

solutions/1466. Reorder Routes to Make All Paths Lead to the City Zero/1466.java

@@ -1,9 +1,7 @@
 class Solution {
   public int minReorder(int n, int[][] connections) {
     List<Integer>[] graph = new List[n];
-
-    for (int i = 0; i < n; ++i)
-      graph[i] = new ArrayList<>();
+    Arrays.setAll(graph, i -> new ArrayList<>());
 
     for (int[] connection : connections) {
       final int u = connection[0];