feat: update solutions to lc problems

Author: yanglbme

lcof2/剑指 Offer II 113. 课程顺序/README.md

@@ -94,9 +94,7 @@ class Solution:
 class Solution {
     public int[] findOrder(int numCourses, int[][] prerequisites) {
         List<Integer>[] g = new List[numCourses];
-        for (int i = 0; i < numCourses; ++i) {
-            g[i] = new ArrayList<>();
-        }
+        Arrays.setAll(g, k -> new ArrayList<>());
         int[] indeg = new int[numCourses];
         for (var p : prerequisites) {
             int a = p[0], b = p[1];

lcof2/剑指 Offer II 113. 课程顺序/Solution.java

@@ -1,9 +1,7 @@
 class Solution {
     public int[] findOrder(int numCourses, int[][] prerequisites) {
         List<Integer>[] g = new List[numCourses];
-        for (int i = 0; i < numCourses; ++i) {
-            g[i] = new ArrayList<>();
-        }
+        Arrays.setAll(g, k -> new ArrayList<>());
         int[] indeg = new int[numCourses];
         for (var p : prerequisites) {
             int a = p[0], b = p[1];

lcof2/剑指 Offer II 115. 重建序列/README.md

@@ -116,9 +116,7 @@ class Solution {
         int n = nums.length;
         int[] indeg = new int[n];
         List<Integer>[] g = new List[n];
-        for (int i = 0; i < n; ++i) {
-            g[i] = new ArrayList<>();
-        }
+        Arrays.setAll(g, k -> new ArrayList<>());
         for (int[] seq : sequences) {
             for (int i = 1; i < seq.length; ++i) {
                 int a = seq[i - 1] - 1, b = seq[i] - 1;

lcof2/剑指 Offer II 115. 重建序列/Solution.java

@@ -3,9 +3,7 @@ public boolean sequenceReconstruction(int[] nums, int[][] sequences) {
         int n = nums.length;
         int[] indeg = new int[n];
         List<Integer>[] g = new List[n];
-        for (int i = 0; i < n; ++i) {
-            g[i] = new ArrayList<>();
-        }
+        Arrays.setAll(g, k -> new ArrayList<>());
         for (int[] seq : sequences) {
             for (int i = 1; i < seq.length; ++i) {
                 int a = seq[i - 1] - 1, b = seq[i] - 1;

lcp/LCP 05. 发 LeetCoin/README.md

@@ -289,9 +289,7 @@ class Solution {
 
     public int[] bonus(int n, int[][] leadership, int[][] operations) {
         g = new List[n + 1];
-        for (int i = 0; i < g.length; ++i) {
-            g[i] = new ArrayList<>();
-        }
+        Arrays.setAll(g, k -> new ArrayList<>());
         for (int[] l : leadership) {
             int a = l[0], b = l[1];
             g[a].add(b);

lcp/LCP 05. 发 LeetCoin/Solution.java

@@ -96,9 +96,7 @@ class Solution {
 
     public int[] bonus(int n, int[][] leadership, int[][] operations) {
         g = new List[n + 1];
-        for (int i = 0; i < g.length; ++i) {
-            g[i] = new ArrayList<>();
-        }
+        Arrays.setAll(g, k -> new ArrayList<>());
         for (int[] l : leadership) {
             int a = l[0], b = l[1];
             g[a].add(b);

solution/0200-0299/0207.Course Schedule/README.md

@@ -86,9 +86,7 @@ class Solution:
 class Solution {
     public boolean canFinish(int numCourses, int[][] prerequisites) {
         List<Integer>[] g = new List[numCourses];
-        for (int i = 0; i < numCourses; ++i) {
-            g[i] = new ArrayList<>();
-        }
+        Arrays.setAll(g, k -> new ArrayList<>());
         int[] indeg = new int[numCourses];
         for (var p : prerequisites) {
             int a = p[0], b = p[1];

solution/0200-0299/0207.Course Schedule/README_EN.md

@@ -74,9 +74,7 @@ class Solution:
 class Solution {
     public boolean canFinish(int numCourses, int[][] prerequisites) {
         List<Integer>[] g = new List[numCourses];
-        for (int i = 0; i < numCourses; ++i) {
-            g[i] = new ArrayList<>();
-        }
+        Arrays.setAll(g, k -> new ArrayList<>());
         int[] indeg = new int[numCourses];
         for (var p : prerequisites) {
             int a = p[0], b = p[1];

solution/0200-0299/0207.Course Schedule/Solution.java

@@ -1,9 +1,7 @@
 class Solution {
     public boolean canFinish(int numCourses, int[][] prerequisites) {
         List<Integer>[] g = new List[numCourses];
-        for (int i = 0; i < numCourses; ++i) {
-            g[i] = new ArrayList<>();
-        }
+        Arrays.setAll(g, k -> new ArrayList<>());
         int[] indeg = new int[numCourses];
         for (var p : prerequisites) {
             int a = p[0], b = p[1];

solution/0200-0299/0210.Course Schedule II/README.md

@@ -91,9 +91,7 @@ class Solution:
 class Solution {
     public int[] findOrder(int numCourses, int[][] prerequisites) {
         List<Integer>[] g = new List[numCourses];
-        for (int i = 0; i < numCourses; ++i) {
-            g[i] = new ArrayList<>();
-        }
+        Arrays.setAll(g, k -> new ArrayList<>());
         int[] indeg = new int[numCourses];
         for (var p : prerequisites) {
             int a = p[0], b = p[1];