FairyWorld · pull · Apr 3, 2023 · Apr 3, 2023 · Apr 3, 2023 · Apr 3, 2023
diff --git a/lcci/17.08.Circus Tower/README.md b/lcci/17.08.Circus Tower/README.md
@@ -105,7 +105,7 @@ class Solution {
         int n = height.length;
         int[][] arr = new int[n][2];
         for (int i = 0; i < n; ++i) {
-            arr[i] = new int[]{height[i], weight[i]};
+            arr[i] = new int[] {height[i], weight[i]};
         }
         Arrays.sort(arr, (a, b) -> a[0] == b[0] ? b[1] - a[1] : a[0] - b[0]);
         Set<Integer> s = new HashSet<>();

diff --git a/lcci/17.08.Circus Tower/README_EN.md b/lcci/17.08.Circus Tower/README_EN.md
@@ -94,7 +94,7 @@ class Solution {
         int n = height.length;
         int[][] arr = new int[n][2];
         for (int i = 0; i < n; ++i) {
-            arr[i] = new int[]{height[i], weight[i]};
+            arr[i] = new int[] {height[i], weight[i]};
         }
         Arrays.sort(arr, (a, b) -> a[0] == b[0] ? b[1] - a[1] : a[0] - b[0]);
         Set<Integer> s = new HashSet<>();

diff --git a/lcci/17.08.Circus Tower/Solution.java b/lcci/17.08.Circus Tower/Solution.java
@@ -29,7 +29,7 @@ public int bestSeqAtIndex(int[] height, int[] weight) {
         int n = height.length;
         int[][] arr = new int[n][2];
         for (int i = 0; i < n; ++i) {
-            arr[i] = new int[]{height[i], weight[i]};
+            arr[i] = new int[] {height[i], weight[i]};
         }
         Arrays.sort(arr, (a, b) -> a[0] == b[0] ? b[1] - a[1] : a[0] - b[0]);
         Set<Integer> s = new HashSet<>();

diff --git a/solution/0400-0499/0480.Sliding Window Median/README.md b/solution/0400-0499/0480.Sliding Window Median/README.md
@@ -219,7 +219,6 @@ class MedianFinder {
     }
 }
 
-
 class Solution {
     public double[] medianSlidingWindow(int[] nums, int k) {
         MedianFinder finder = new MedianFinder(k);

diff --git a/solution/0400-0499/0480.Sliding Window Median/README_EN.md b/solution/0400-0499/0480.Sliding Window Median/README_EN.md
@@ -191,7 +191,6 @@ class MedianFinder {
     }
 }
 
-
 class Solution {
     public double[] medianSlidingWindow(int[] nums, int k) {
         MedianFinder finder = new MedianFinder(k);

diff --git a/solution/0400-0499/0480.Sliding Window Median/Solution.cpp b/solution/0400-0499/0480.Sliding Window Median/Solution.cpp
@@ -43,7 +43,7 @@ class MedianFinder {
     int largeSize = 0;
     int k;
 
-    template<typename T>
+    template <typename T>
     void prune(T& pq) {
         while (!pq.empty() && delayed[pq.top()]) {
             if (--delayed[pq.top()] == 0) {

diff --git a/solution/0400-0499/0480.Sliding Window Median/Solution.java b/solution/0400-0499/0480.Sliding Window Median/Solution.java
@@ -65,7 +65,6 @@ private void rebalance() {
     }
 }
 
-
 class Solution {
     public double[] medianSlidingWindow(int[] nums, int k) {
         MedianFinder finder = new MedianFinder(k);

diff --git a/solution/0500-0599/0514.Freedom Trail/README.md b/solution/0500-0599/0514.Freedom Trail/README.md
@@ -121,7 +121,8 @@ class Solution {
         for (int i = 1; i < m; ++i) {
             for (int j : pos[key.charAt(i) - 'a']) {
                 for (int k : pos[key.charAt(i - 1) - 'a']) {
-                    f[i][j] = Math.min(f[i][j], f[i - 1][k] + Math.min(Math.abs(j - k), n - Math.abs(j - k)) + 1);
+                    f[i][j] = Math.min(
+                        f[i][j], f[i - 1][k] + Math.min(Math.abs(j - k), n - Math.abs(j - k)) + 1);
                 }
             }
         }

diff --git a/solution/0500-0599/0514.Freedom Trail/README_EN.md b/solution/0500-0599/0514.Freedom Trail/README_EN.md
@@ -93,7 +93,8 @@ class Solution {
         for (int i = 1; i < m; ++i) {
             for (int j : pos[key.charAt(i) - 'a']) {
                 for (int k : pos[key.charAt(i - 1) - 'a']) {
-                    f[i][j] = Math.min(f[i][j], f[i - 1][k] + Math.min(Math.abs(j - k), n - Math.abs(j - k)) + 1);
+                    f[i][j] = Math.min(
+                        f[i][j], f[i - 1][k] + Math.min(Math.abs(j - k), n - Math.abs(j - k)) + 1);
                 }
             }
         }

diff --git a/solution/0500-0599/0514.Freedom Trail/Solution.cpp b/solution/0500-0599/0514.Freedom Trail/Solution.cpp
@@ -14,7 +14,7 @@ class Solution {
         for (int i = 1; i < m; ++i) {
             for (int j : pos[key[i] - 'a']) {
                 for (int k : pos[key[i - 1] - 'a']) {
-                    f[i][j] = min(f[i][j], f[i - 1][k] + min(abs(j - k), n - abs(j -  k)) + 1);
+                    f[i][j] = min(f[i][j], f[i - 1][k] + min(abs(j - k), n - abs(j - k)) + 1);
                 }
             }
         }

diff --git a/solution/0500-0599/0514.Freedom Trail/Solution.java b/solution/0500-0599/0514.Freedom Trail/Solution.java
@@ -17,7 +17,8 @@ public int findRotateSteps(String ring, String key) {
         for (int i = 1; i < m; ++i) {
             for (int j : pos[key.charAt(i) - 'a']) {
                 for (int k : pos[key.charAt(i - 1) - 'a']) {
-                    f[i][j] = Math.min(f[i][j], f[i - 1][k] + Math.min(Math.abs(j - k), n - Math.abs(j - k)) + 1);
+                    f[i][j] = Math.min(
+                        f[i][j], f[i - 1][k] + Math.min(Math.abs(j - k), n - Math.abs(j - k)) + 1);
                 }
             }
         }

diff --git a/solution/0600-0699/0665.Non-decreasing Array/Solution.java b/solution/0600-0699/0665.Non-decreasing Array/Solution.java
@@ -14,7 +14,7 @@ public boolean checkPossibility(int[] nums) {
         }
         return true;
     }
-    
+
     private boolean isSorted(int[] nums) {
         for (int i = 0; i < nums.length - 1; ++i) {
             if (nums[i] > nums[i + 1]) {

diff --git a/solution/0800-0899/0842.Split Array into Fibonacci Sequence/README.md b/solution/0800-0899/0842.Split Array into Fibonacci Sequence/README.md
@@ -127,7 +127,8 @@ class Solution {
                 break;
             }
             x = x * 10 + num.charAt(j) - '0';
-            if (x > Integer.MAX_VALUE || (ans.size() >= 2 && x > ans.get(ans.size() - 1) + ans.get(ans.size() - 2))) {
+            if (x > Integer.MAX_VALUE
+                || (ans.size() >= 2 && x > ans.get(ans.size() - 1) + ans.get(ans.size() - 2))) {
                 break;
             }
             if (ans.size() < 2 || x == ans.get(ans.size() - 1) + ans.get(ans.size() - 2)) {

diff --git a/solution/0800-0899/0842.Split Array into Fibonacci Sequence/README_EN.md b/solution/0800-0899/0842.Split Array into Fibonacci Sequence/README_EN.md
@@ -106,7 +106,8 @@ class Solution {
                 break;
             }
             x = x * 10 + num.charAt(j) - '0';
-            if (x > Integer.MAX_VALUE || (ans.size() >= 2 && x > ans.get(ans.size() - 1) + ans.get(ans.size() - 2))) {
+            if (x > Integer.MAX_VALUE
+                || (ans.size() >= 2 && x > ans.get(ans.size() - 1) + ans.get(ans.size() - 2))) {
                 break;
             }
             if (ans.size() < 2 || x == ans.get(ans.size() - 1) + ans.get(ans.size() - 2)) {

diff --git a/solution/0800-0899/0842.Split Array into Fibonacci Sequence/Solution.java b/solution/0800-0899/0842.Split Array into Fibonacci Sequence/Solution.java
@@ -18,7 +18,8 @@ private boolean dfs(int i) {
                 break;
             }
             x = x * 10 + num.charAt(j) - '0';
-            if (x > Integer.MAX_VALUE || (ans.size() >= 2 && x > ans.get(ans.size() - 1) + ans.get(ans.size() - 2))) {
+            if (x > Integer.MAX_VALUE
+                || (ans.size() >= 2 && x > ans.get(ans.size() - 1) + ans.get(ans.size() - 2))) {
                 break;
             }
             if (ans.size() < 2 || x == ans.get(ans.size() - 1) + ans.get(ans.size() - 2)) {

diff --git a/solution/0800-0899/0879.Profitable Schemes/README.md b/solution/0800-0899/0879.Profitable Schemes/README.md
@@ -106,7 +106,10 @@ class Solution {
                 for (int k = 0; k <= minProfit; ++k) {
                     f[i][j][k] = f[i - 1][j][k];
                     if (j >= group[i - 1]) {
-                        f[i][j][k] = (f[i][j][k] + f[i - 1][j - group[i - 1]][Math.max(0, k - profit[i - 1])]) % mod;
+                        f[i][j][k]
+                            = (f[i][j][k]
+                                  + f[i - 1][j - group[i - 1]][Math.max(0, k - profit[i - 1])])
+                            % mod;
                     }
                 }
             }

diff --git a/solution/0800-0899/0879.Profitable Schemes/README_EN.md b/solution/0800-0899/0879.Profitable Schemes/README_EN.md
@@ -80,7 +80,10 @@ class Solution {
                 for (int k = 0; k <= minProfit; ++k) {
                     f[i][j][k] = f[i - 1][j][k];
                     if (j >= group[i - 1]) {
-                        f[i][j][k] = (f[i][j][k] + f[i - 1][j - group[i - 1]][Math.max(0, k - profit[i - 1])]) % mod;
+                        f[i][j][k]
+                            = (f[i][j][k]
+                                  + f[i - 1][j - group[i - 1]][Math.max(0, k - profit[i - 1])])
+                            % mod;
                     }
                 }
             }

diff --git a/solution/0800-0899/0879.Profitable Schemes/Solution.java b/solution/0800-0899/0879.Profitable Schemes/Solution.java
@@ -11,7 +11,10 @@ public int profitableSchemes(int n, int minProfit, int[] group, int[] profit) {
                 for (int k = 0; k <= minProfit; ++k) {
                     f[i][j][k] = f[i - 1][j][k];
                     if (j >= group[i - 1]) {
-                        f[i][j][k] = (f[i][j][k] + f[i - 1][j - group[i - 1]][Math.max(0, k - profit[i - 1])]) % mod;
+                        f[i][j][k]
+                            = (f[i][j][k]
+                                  + f[i - 1][j - group[i - 1]][Math.max(0, k - profit[i - 1])])
+                            % mod;
                     }
                 }
             }

diff --git a/solution/1000-1099/1000.Minimum Cost to Merge Stones/README.md b/solution/1000-1099/1000.Minimum Cost to Merge Stones/README.md
@@ -122,7 +122,7 @@ class Solution {
         int[][][] f = new int[n + 1][n + 1][K + 1];
         final int inf = 1 << 20;
         for (int[][] g : f) {
-            for(int[] e : g) {
+            for (int[] e : g) {
                 Arrays.fill(e, inf);
             }
         }

diff --git a/solution/1000-1099/1000.Minimum Cost to Merge Stones/README_EN.md b/solution/1000-1099/1000.Minimum Cost to Merge Stones/README_EN.md
@@ -94,7 +94,7 @@ class Solution {
         int[][][] f = new int[n + 1][n + 1][K + 1];
         final int inf = 1 << 20;
         for (int[][] g : f) {
-            for(int[] e : g) {
+            for (int[] e : g) {
                 Arrays.fill(e, inf);
             }
         }

diff --git a/solution/1000-1099/1000.Minimum Cost to Merge Stones/Solution.java b/solution/1000-1099/1000.Minimum Cost to Merge Stones/Solution.java
@@ -11,7 +11,7 @@ public int mergeStones(int[] stones, int K) {
         int[][][] f = new int[n + 1][n + 1][K + 1];
         final int inf = 1 << 20;
         for (int[][] g : f) {
-            for(int[] e : g) {
+            for (int[] e : g) {
                 Arrays.fill(e, inf);
             }
         }

diff --git a/solution/1000-1099/1030.Matrix Cells in Distance Order/README.md b/solution/1000-1099/1030.Matrix Cells in Distance Order/README.md
@@ -99,7 +99,7 @@ import java.util.Deque;
 class Solution {
     public int[][] allCellsDistOrder(int rows, int cols, int rCenter, int cCenter) {
         Deque<int[]> q = new ArrayDeque<>();
-        q.offer(new int[]{rCenter, cCenter});
+        q.offer(new int[] {rCenter, cCenter});
         boolean[][] vis = new boolean[rows][cols];
         vis[rCenter][cCenter] = true;
         int[][] ans = new int[rows * cols][2];
@@ -113,7 +113,7 @@ class Solution {
                     int x = p[0] + dirs[k], y = p[1] + dirs[k + 1];
                     if (x >= 0 && x < rows && y >= 0 && y < cols && !vis[x][y]) {
                         vis[x][y] = true;
-                        q.offer(new int[]{x, y});
+                        q.offer(new int[] {x, y});
                     }
                 }
             }

diff --git a/solution/1000-1099/1030.Matrix Cells in Distance Order/README_EN.md b/solution/1000-1099/1030.Matrix Cells in Distance Order/README_EN.md
@@ -81,7 +81,7 @@ import java.util.Deque;
 class Solution {
     public int[][] allCellsDistOrder(int rows, int cols, int rCenter, int cCenter) {
         Deque<int[]> q = new ArrayDeque<>();
-        q.offer(new int[]{rCenter, cCenter});
+        q.offer(new int[] {rCenter, cCenter});
         boolean[][] vis = new boolean[rows][cols];
         vis[rCenter][cCenter] = true;
         int[][] ans = new int[rows * cols][2];
@@ -95,7 +95,7 @@ class Solution {
                     int x = p[0] + dirs[k], y = p[1] + dirs[k + 1];
                     if (x >= 0 && x < rows && y >= 0 && y < cols && !vis[x][y]) {
                         vis[x][y] = true;
-                        q.offer(new int[]{x, y});
+                        q.offer(new int[] {x, y});
                     }
                 }
             }

diff --git a/solution/1000-1099/1030.Matrix Cells in Distance Order/Solution.java b/solution/1000-1099/1030.Matrix Cells in Distance Order/Solution.java
@@ -3,7 +3,7 @@
 class Solution {
     public int[][] allCellsDistOrder(int rows, int cols, int rCenter, int cCenter) {
         Deque<int[]> q = new ArrayDeque<>();
-        q.offer(new int[]{rCenter, cCenter});
+        q.offer(new int[] {rCenter, cCenter});
         boolean[][] vis = new boolean[rows][cols];
         vis[rCenter][cCenter] = true;
         int[][] ans = new int[rows * cols][2];
@@ -17,7 +17,7 @@ public int[][] allCellsDistOrder(int rows, int cols, int rCenter, int cCenter) {
                     int x = p[0] + dirs[k], y = p[1] + dirs[k + 1];
                     if (x >= 0 && x < rows && y >= 0 && y < cols && !vis[x][y]) {
                         vis[x][y] = true;
-                        q.offer(new int[]{x, y});
+                        q.offer(new int[] {x, y});
                     }
                 }
             }

diff --git a/solution/1000-1099/1033.Moving Stones Until Consecutive/README.md b/solution/1000-1099/1033.Moving Stones Until Consecutive/README.md
@@ -92,7 +92,7 @@ class Solution {
             mi = y - x < 3 || z - y < 3 ? 1 : 2;
             mx = z - x - 2;
         }
-        return new int[]{mi, mx};
+        return new int[] {mi, mx};
     }
 }
 ```

diff --git a/solution/1000-1099/1033.Moving Stones Until Consecutive/README_EN.md b/solution/1000-1099/1033.Moving Stones Until Consecutive/README_EN.md
@@ -81,7 +81,7 @@ class Solution {
             mi = y - x < 3 || z - y < 3 ? 1 : 2;
             mx = z - x - 2;
         }
-        return new int[]{mi, mx};
+        return new int[] {mi, mx};
     }
 }
 ```

diff --git a/solution/1000-1099/1033.Moving Stones Until Consecutive/Solution.java b/solution/1000-1099/1033.Moving Stones Until Consecutive/Solution.java
@@ -8,6 +8,6 @@ public int[] numMovesStones(int a, int b, int c) {
             mi = y - x < 3 || z - y < 3 ? 1 : 2;
             mx = z - x - 2;
         }
-        return new int[]{mi, mx};
+        return new int[] {mi, mx};
     }
 }
diff --git a/solution/1000-1099/1039.Minimum Score Triangulation of Polygon/README.md b/solution/1000-1099/1039.Minimum Score Triangulation of Polygon/README.md
@@ -211,7 +211,8 @@ class Solution {
                 int j = i + l - 1;
                 f[i][j] = 1 << 30;
                 for (int k = i + 1; k < j; ++k) {
-                    f[i][j] = Math.min(f[i][j], f[i][k] + f[k][j] + values[i] * values[k] * values[j]);
+                    f[i][j]
+                        = Math.min(f[i][j], f[i][k] + f[k][j] + values[i] * values[k] * values[j]);
                 }
             }
         }

diff --git a/solution/1000-1099/1039.Minimum Score Triangulation of Polygon/README_EN.md b/solution/1000-1099/1039.Minimum Score Triangulation of Polygon/README_EN.md
@@ -145,7 +145,8 @@ class Solution {
                 int j = i + l - 1;
                 f[i][j] = 1 << 30;
                 for (int k = i + 1; k < j; ++k) {
-                    f[i][j] = Math.min(f[i][j], f[i][k] + f[k][j] + values[i] * values[k] * values[j]);
+                    f[i][j]
+                        = Math.min(f[i][j], f[i][k] + f[k][j] + values[i] * values[k] * values[j]);
                 }
             }
         }

diff --git a/solution/1100-1199/1101.The Earliest Moment When Everyone Become Friends/Solution.java b/solution/1100-1199/1101.The Earliest Moment When Everyone Become Friends/Solution.java
@@ -1,6 +1,6 @@
 class Solution {
     private int[] p;
-    
+
     public int earliestAcq(int[][] logs, int n) {
         Arrays.sort(logs, (a, b) -> a[0] - b[0]);
         p = new int[n];
@@ -19,7 +19,7 @@ public int earliestAcq(int[][] logs, int n) {
         }
         return -1;
     }
-    
+
     private int find(int x) {
         if (p[x] != x) {
             p[x] = find(p[x]);

diff --git a/solution/1100-1199/1109.Corporate Flight Bookings/README.md b/solution/1100-1199/1109.Corporate Flight Bookings/README.md
@@ -151,7 +151,7 @@ class Solution {
     public int[] corpFlightBookings(int[][] bookings, int n) {
         BinaryIndexedTree tree = new BinaryIndexedTree(n);
         for (var e : bookings) {
-            int first =e[0], last = e[1], seats = e[2];
+            int first = e[0], last = e[1], seats = e[2];
             tree.update(first, seats);
             tree.update(last + 1, -seats);
         }

diff --git a/solution/1100-1199/1109.Corporate Flight Bookings/README_EN.md b/solution/1100-1199/1109.Corporate Flight Bookings/README_EN.md
@@ -121,7 +121,7 @@ class Solution {
     public int[] corpFlightBookings(int[][] bookings, int n) {
         BinaryIndexedTree tree = new BinaryIndexedTree(n);
         for (var e : bookings) {
-            int first =e[0], last = e[1], seats = e[2];
+            int first = e[0], last = e[1], seats = e[2];
             tree.update(first, seats);
             tree.update(last + 1, -seats);
         }

diff --git a/solution/1300-1399/1301.Number of Paths with Max Score/README.md b/solution/1300-1399/1301.Number of Paths with Max Score/README.md
@@ -138,7 +138,8 @@ class Solution {
     }
 
     private void update(int i, int j, int x, int y) {
-        if (x >= n || y >= n || f[x][y] == -1 || board.get(i).charAt(j) == 'X' || board.get(i).charAt(j) == 'S') {
+        if (x >= n || y >= n || f[x][y] == -1 || board.get(i).charAt(j) == 'X'
+            || board.get(i).charAt(j) == 'S') {
             return;
         }
         if (f[x][y] > f[i][j]) {

diff --git a/solution/1300-1399/1301.Number of Paths with Max Score/README_EN.md b/solution/1300-1399/1301.Number of Paths with Max Score/README_EN.md
@@ -117,7 +117,8 @@ class Solution {
     }
 
     private void update(int i, int j, int x, int y) {
-        if (x >= n || y >= n || f[x][y] == -1 || board.get(i).charAt(j) == 'X' || board.get(i).charAt(j) == 'S') {
+        if (x >= n || y >= n || f[x][y] == -1 || board.get(i).charAt(j) == 'X'
+            || board.get(i).charAt(j) == 'S') {
             return;
         }
         if (f[x][y] > f[i][j]) {

diff --git a/solution/1300-1399/1301.Number of Paths with Max Score/Solution.java b/solution/1300-1399/1301.Number of Paths with Max Score/Solution.java
@@ -37,7 +37,8 @@ public int[] pathsWithMaxScore(List<String> board) {
     }
 
     private void update(int i, int j, int x, int y) {
-        if (x >= n || y >= n || f[x][y] == -1 || board.get(i).charAt(j) == 'X' || board.get(i).charAt(j) == 'S') {
+        if (x >= n || y >= n || f[x][y] == -1 || board.get(i).charAt(j) == 'X'
+            || board.get(i).charAt(j) == 'S') {
             return;
         }
         if (f[x][y] > f[i][j]) {

diff --git a/solution/1300-1399/1338.Reduce Array Size to The Half/README.md b/solution/1300-1399/1338.Reduce Array Size to The Half/README.md
@@ -87,7 +87,7 @@ class Solution {
         Arrays.sort(cnt);
         int ans = 0;
         int m = 0;
-        for (int i = mx; ; --i) {
+        for (int i = mx;; --i) {
             if (cnt[i] > 0) {
                 m += cnt[i];
                 ++ans;

diff --git a/solution/1300-1399/1338.Reduce Array Size to The Half/README_EN.md b/solution/1300-1399/1338.Reduce Array Size to The Half/README_EN.md
@@ -71,7 +71,7 @@ class Solution {
         Arrays.sort(cnt);
         int ans = 0;
         int m = 0;
-        for (int i = mx; ; --i) {
+        for (int i = mx;; --i) {
             if (cnt[i] > 0) {
                 m += cnt[i];
                 ++ans;

diff --git a/solution/1300-1399/1338.Reduce Array Size to The Half/Solution.java b/solution/1300-1399/1338.Reduce Array Size to The Half/Solution.java
@@ -11,7 +11,7 @@ public int minSetSize(int[] arr) {
         Arrays.sort(cnt);
         int ans = 0;
         int m = 0;
-        for (int i = mx; ; --i) {
+        for (int i = mx;; --i) {
             if (cnt[i] > 0) {
                 m += cnt[i];
                 ++ans;
-Original file line number
+Diff line change
@@ Expand Up / @@ -219,7 +219,6 @@ class MedianFinder { @@
         }
     }
     class Solution {
         public double[] medianSlidingWindow(int[] nums, int k) {
             MedianFinder finder = new MedianFinder(k);
@@ Expand Down @@