style: format code

yanglbme · yanglbme · commit c9b768ff4702 · 2023-02-15T19:18:47.000+08:00
diff --git a/solution/0500-0599/0555.Split Concatenated Strings/README.md b/solution/0500-0599/0555.Split Concatenated Strings/README.md
@@ -114,8 +114,11 @@ class Solution {
                 if (ans.compareTo(cur) < 0) {
                     ans = cur;
                 }
-                cur = new StringBuilder(b).reverse().append(t)
-                .append(new StringBuilder(a).reverse().toString()).toString();
+                cur = new StringBuilder(b)
+                          .reverse()
+                          .append(t)
+                          .append(new StringBuilder(a).reverse().toString())
+                          .toString();
                 if (ans.compareTo(cur) < 0) {
                     ans = cur;
                 }
diff --git a/solution/0500-0599/0555.Split Concatenated Strings/README_EN.md b/solution/0500-0599/0555.Split Concatenated Strings/README_EN.md
@@ -96,8 +96,11 @@ class Solution {
                 if (ans.compareTo(cur) < 0) {
                     ans = cur;
                 }
-                cur = new StringBuilder(b).reverse().append(t)
-                .append(new StringBuilder(a).reverse().toString()).toString();
+                cur = new StringBuilder(b)
+                          .reverse()
+                          .append(t)
+                          .append(new StringBuilder(a).reverse().toString())
+                          .toString();
                 if (ans.compareTo(cur) < 0) {
                     ans = cur;
                 }
diff --git a/solution/0500-0599/0555.Split Concatenated Strings/Solution.java b/solution/0500-0599/0555.Split Concatenated Strings/Solution.java
@@ -26,8 +26,11 @@ public String splitLoopedString(String[] strs) {
                 if (ans.compareTo(cur) < 0) {
                     ans = cur;
                 }
-                cur = new StringBuilder(b).reverse().append(t)
-                .append(new StringBuilder(a).reverse().toString()).toString();
+                cur = new StringBuilder(b)
+                          .reverse()
+                          .append(t)
+                          .append(new StringBuilder(a).reverse().toString())
+                          .toString();
                 if (ans.compareTo(cur) < 0) {
                     ans = cur;
                 }
diff --git a/solution/0900-0999/0993.Cousins in Binary Tree/Solution.cpp b/solution/0900-0999/0993.Cousins in Binary Tree/Solution.cpp
@@ -12,7 +12,7 @@
 class Solution {
 public:
     bool isCousins(TreeNode* root, int x, int y) {
-        TreeNode* p1, *p2;
+        TreeNode *p1, *p2;
         int d1, d2;
         function<void(TreeNode*, TreeNode*, int)> dfs = [&](TreeNode* root, TreeNode* fa, int d) {
             if (!root) {
diff --git a/solution/1000-1099/1019.Next Greater Node In Linked List/README_EN.md b/solution/1000-1099/1019.Next Greater Node In Linked List/README_EN.md
@@ -129,7 +129,7 @@ public:
             }
             if (!stk.empty()) {
                 ans[i] = stk.top();
-            
+
             }
             stk.push(nums[i]);
         }
diff --git a/solution/1000-1099/1019.Next Greater Node In Linked List/Solution.cpp b/solution/1000-1099/1019.Next Greater Node In Linked List/Solution.cpp
@@ -24,7 +24,6 @@ class Solution {
             }
             if (!stk.empty()) {
                 ans[i] = stk.top();
-            
             }
             stk.push(nums[i]);
         }
diff --git a/solution/1200-1299/1233.Remove Sub-Folders from the Filesystem/Solution.java b/solution/1200-1299/1233.Remove Sub-Folders from the Filesystem/Solution.java
@@ -6,7 +6,9 @@ public List<String> removeSubfolders(String[] folder) {
         for (int i = 1; i < folder.length; ++i) {
             int m = ans.get(ans.size() - 1).length();
             int n = folder[i].length();
-            if (m >= n || !(ans.get(ans.size() - 1).equals(folder[i].substring(0, m)) && folder[i].charAt(m) == '/')) {
+            if (m >= n
+                || !(ans.get(ans.size() - 1).equals(folder[i].substring(0, m))
+                    && folder[i].charAt(m) == '/')) {
                 ans.add(folder[i]);
             }
         }
diff --git a/solution/1200-1299/1244.Design A Leaderboard/README.md b/solution/1200-1299/1244.Design A Leaderboard/README.md
@@ -123,7 +123,6 @@ class Leaderboard {
     private TreeMap<Integer, Integer> rank = new TreeMap<>((a, b) -> b - a);
 
     public Leaderboard() {
-
     }
 
     public void addScore(int playerId, int score) {
diff --git a/solution/1200-1299/1244.Design A Leaderboard/README_EN.md b/solution/1200-1299/1244.Design A Leaderboard/README_EN.md
@@ -94,18 +94,17 @@ class Leaderboard {
     private TreeMap<Integer, Integer> rank = new TreeMap<>((a, b) -> b - a);
 
     public Leaderboard() {
-
     }
-    
+
     public void addScore(int playerId, int score) {
         d.merge(playerId, score, Integer::sum);
         int newScore = d.get(playerId);
         if (newScore != score) {
-            rank.merge(newScore - score, -1, Integer::sum);   
+            rank.merge(newScore - score, -1, Integer::sum);
         }
         rank.merge(newScore, 1, Integer::sum);
     }
-    
+
     public int top(int K) {
         int ans = 0;
         for (var e : rank.entrySet()) {
@@ -119,7 +118,7 @@ class Leaderboard {
         }
         return ans;
     }
-    
+
     public void reset(int playerId) {
         int score = d.remove(playerId);
         if (rank.merge(score, -1, Integer::sum) == 0) {
@@ -145,7 +144,7 @@ public:
     Leaderboard() {
 
     }
-    
+
     void addScore(int playerId, int score) {
         d[playerId] += score;
         int newScore = d[playerId];
@@ -154,7 +153,7 @@ public:
         }
         rank.insert(newScore);
     }
-    
+
     int top(int K) {
         int ans = 0;
         for (auto& x : rank) {
@@ -165,7 +164,7 @@ public:
         }
         return ans;
     }
-    
+
     void reset(int playerId) {
         int score = d[playerId];
         d.erase(playerId);
diff --git a/solution/1200-1299/1244.Design A Leaderboard/Solution.cpp b/solution/1200-1299/1244.Design A Leaderboard/Solution.cpp
@@ -1,9 +1,8 @@
 class Leaderboard {
 public:
     Leaderboard() {
-
     }
-    
+
     void addScore(int playerId, int score) {
         d[playerId] += score;
         int newScore = d[playerId];
@@ -12,7 +11,7 @@ class Leaderboard {
         }
         rank.insert(newScore);
     }
-    
+
     int top(int K) {
         int ans = 0;
         for (auto& x : rank) {
@@ -23,7 +22,7 @@ class Leaderboard {
         }
         return ans;
     }
-    
+
     void reset(int playerId) {
         int score = d[playerId];
         d.erase(playerId);
diff --git a/solution/1200-1299/1244.Design A Leaderboard/Solution.java b/solution/1200-1299/1244.Design A Leaderboard/Solution.java
@@ -3,18 +3,17 @@ class Leaderboard {
     private TreeMap<Integer, Integer> rank = new TreeMap<>((a, b) -> b - a);
 
     public Leaderboard() {
-
     }
-    
+
     public void addScore(int playerId, int score) {
         d.merge(playerId, score, Integer::sum);
         int newScore = d.get(playerId);
         if (newScore != score) {
-            rank.merge(newScore - score, -1, Integer::sum);   
+            rank.merge(newScore - score, -1, Integer::sum);
         }
         rank.merge(newScore, 1, Integer::sum);
     }
-    
+
     public int top(int K) {
         int ans = 0;
         for (var e : rank.entrySet()) {
@@ -28,7 +27,7 @@ public int top(int K) {
         }
         return ans;
     }
-    
+
     public void reset(int playerId) {
         int score = d.remove(playerId);
         if (rank.merge(score, -1, Integer::sum) == 0) {
diff --git a/solution/1200-1299/1250.Check If It Is a Good Array/README.md b/solution/1200-1299/1250.Check If It Is a Good Array/README.md
@@ -57,7 +57,6 @@
 
 所以我们将题目转化为：判断数组 `nums` 中的所有数的最大公约数是否为 $1$。遍历数组 `nums`，求出数组 `nums` 中的所有数的最大公约数即可。
 
-
 时间复杂度 $O(n + log m)$，空间复杂度 $O(1)$，其中 $n$ 是数组 `nums` 的长度，而 $m$ 是数组 `nums` 中的最大值。
 
 <!-- tabs:start -->
diff --git a/solution/1200-1299/1261.Find Elements in a Contaminated Binary Tree/README_EN.md b/solution/1200-1299/1261.Find Elements in a Contaminated Binary Tree/README_EN.md
@@ -151,7 +151,7 @@ class FindElements {
             dfs(root.right);
         }
     }
-    
+
     public boolean find(int target) {
         return vis.contains(target);
     }
@@ -195,7 +195,7 @@ public:
         };
         dfs(root);
     }
-    
+
     bool find(int target) {
         return vis.count(target);
     }
diff --git a/solution/1200-1299/1261.Find Elements in a Contaminated Binary Tree/Solution.cpp b/solution/1200-1299/1261.Find Elements in a Contaminated Binary Tree/Solution.cpp
@@ -26,7 +26,7 @@ class FindElements {
         };
         dfs(root);
     }
-    
+
     bool find(int target) {
         return vis.count(target);
     }
diff --git a/solution/1200-1299/1261.Find Elements in a Contaminated Binary Tree/Solution.java b/solution/1200-1299/1261.Find Elements in a Contaminated Binary Tree/Solution.java
@@ -32,7 +32,7 @@ private void dfs(TreeNode root) {
             dfs(root.right);
         }
     }
-    
+
     public boolean find(int target) {
         return vis.contains(target);
     }
diff --git a/solution/2500-2599/2553.Separate the Digits in an Array/Solution.c b/solution/2500-2599/2553.Separate the Digits in an Array/Solution.c
@@ -1,7 +1,7 @@
 /**
  * Note: The returned array must be malloced, assume caller calls free().
  */
-int *separateDigits(int *nums, int numsSize, int *returnSize) {
+int* separateDigits(int* nums, int numsSize, int* returnSize) {
     int n = 0;
     for (int i = 0; i < numsSize; i++) {
         int t = nums[i];
@@ -10,7 +10,7 @@ int *separateDigits(int *nums, int numsSize, int *returnSize) {
             n++;
         }
     }
-    int *ans = malloc(sizeof(int) * n);
+    int* ans = malloc(sizeof(int) * n);
     for (int i = numsSize - 1, j = n - 1; i >= 0; i--) {
         int t = nums[i];
         while (t != 0) {
diff --git a/solution/2500-2599/2554.Maximum Number of Integers to Choose From a Range I/Solution.c b/solution/2500-2599/2554.Maximum Number of Integers to Choose From a Range I/Solution.c
@@ -1,8 +1,8 @@
-int cmp(const void *a, const void *b) {
-    return *(int *) a - *(int *) b;
+int cmp(const void* a, const void* b) {
+    return *(int*) a - *(int*) b;
 }
 
-int maxCount(int *banned, int bannedSize, int n, int maxSum) {
+int maxCount(int* banned, int bannedSize, int n, int maxSum) {
     qsort(banned, bannedSize, sizeof(int), cmp);
     int sum = 0;
     int ans = 0;
diff --git a/solution/2500-2599/2562.Find the Array Concatenation Value/README.md b/solution/2500-2599/2562.Find the Array Concatenation Value/README.md
@@ -131,7 +131,7 @@ public:
         for (; i < j; ++i, --j) {
             ans += stoi(to_string(nums[i]) + to_string(nums[j]));
         }
-        if (i ==j) {
+        if (i == j) {
             ans += nums[i];
         }
         return ans;
diff --git a/solution/2500-2599/2562.Find the Array Concatenation Value/README_EN.md b/solution/2500-2599/2562.Find the Array Concatenation Value/README_EN.md
@@ -124,7 +124,7 @@ public:
         for (; i < j; ++i, --j) {
             ans += stoi(to_string(nums[i]) + to_string(nums[j]));
         }
-        if (i ==j) {
+        if (i == j) {
             ans += nums[i];
         }
         return ans;
diff --git a/solution/2500-2599/2562.Find the Array Concatenation Value/Solution.c b/solution/2500-2599/2562.Find the Array Concatenation Value/Solution.c
@@ -7,7 +7,7 @@ int getLen(int num) {
     return res;
 }
 
-long long findTheArrayConcVal(int *nums, int numsSize) {
+long long findTheArrayConcVal(int* nums, int numsSize) {
     long long ans = 0;
     int i = 0;
     int j = numsSize - 1;
diff --git a/solution/2500-2599/2562.Find the Array Concatenation Value/Solution.cpp b/solution/2500-2599/2562.Find the Array Concatenation Value/Solution.cpp
@@ -6,7 +6,7 @@ class Solution {
         for (; i < j; ++i, --j) {
             ans += stoi(to_string(nums[i]) + to_string(nums[j]));
         }
-        if (i ==j) {
+        if (i == j) {
             ans += nums[i];
         }
         return ans;
diff --git a/solution/2500-2599/2563.Count the Number of Fair Pairs/README.md b/solution/2500-2599/2563.Count the Number of Fair Pairs/README.md
@@ -89,7 +89,7 @@ class Solution {
         }
         return ans;
     }
-    
+
     private int search(int[] nums, int x, int left) {
         int right = nums.length;
         while (left < right) {
diff --git a/solution/2500-2599/2563.Count the Number of Fair Pairs/README_EN.md b/solution/2500-2599/2563.Count the Number of Fair Pairs/README_EN.md
@@ -73,7 +73,7 @@ class Solution {
         }
         return ans;
     }
-    
+
     private int search(int[] nums, int x, int left) {
         int right = nums.length;
         while (left < right) {
diff --git a/solution/2500-2599/2563.Count the Number of Fair Pairs/Solution.java b/solution/2500-2599/2563.Count the Number of Fair Pairs/Solution.java
@@ -10,7 +10,7 @@ public long countFairPairs(int[] nums, int lower, int upper) {
         }
         return ans;
     }
-    
+
     private int search(int[] nums, int x, int left) {
         int right = nums.length;
         while (left < right) {

Original file line number	Diff line number	Diff line change
`@@ -114,8 +114,11 @@ class Solution {`
`114`	`114`	`if (ans.compareTo(cur) < 0) {`
`115`	`115`	`ans = cur;`
`116`	`116`	`}`
`117`		`- cur = new StringBuilder(b).reverse().append(t)`
`118`		`- .append(new StringBuilder(a).reverse().toString()).toString();`
	`117`	`+ cur = new StringBuilder(b)`
	`118`	`+ .reverse()`
	`119`	`+ .append(t)`
	`120`	`+ .append(new StringBuilder(a).reverse().toString())`
	`121`	`+ .toString();`
`119`	`122`	`if (ans.compareTo(cur) < 0) {`
`120`	`123`	`ans = cur;`
`121`	`124`	`}`
Original file line number	Diff line number	Diff line change
`@@ -96,8 +96,11 @@ class Solution {`
`96`	`96`	`if (ans.compareTo(cur) < 0) {`
`97`	`97`	`ans = cur;`
`98`	`98`	`}`
`99`		`- cur = new StringBuilder(b).reverse().append(t)`
`100`		`- .append(new StringBuilder(a).reverse().toString()).toString();`
	`99`	`+ cur = new StringBuilder(b)`
	`100`	`+ .reverse()`
	`101`	`+ .append(t)`
	`102`	`+ .append(new StringBuilder(a).reverse().toString())`
	`103`	`+ .toString();`
`101`	`104`	`if (ans.compareTo(cur) < 0) {`
`102`	`105`	`ans = cur;`
`103`	`106`	`}`
Original file line number	Diff line number	Diff line change
`@@ -26,8 +26,11 @@ public String splitLoopedString(String[] strs) {`
`26`	`26`	`if (ans.compareTo(cur) < 0) {`
`27`	`27`	`ans = cur;`
`28`	`28`	`}`
`29`		`- cur = new StringBuilder(b).reverse().append(t)`
`30`		`- .append(new StringBuilder(a).reverse().toString()).toString();`
	`29`	`+ cur = new StringBuilder(b)`
	`30`	`+ .reverse()`
	`31`	`+ .append(t)`
	`32`	`+ .append(new StringBuilder(a).reverse().toString())`
	`33`	`+ .toString();`
`31`	`34`	`if (ans.compareTo(cur) < 0) {`
`32`	`35`	`ans = cur;`
`33`	`36`	`}`
Original file line number	Diff line number	Diff line change
`@@ -129,7 +129,7 @@ public:`
`129`	`129`	`}`
`130`	`130`	`if (!stk.empty()) {`
`131`	`131`	`ans[i] = stk.top();`
`132`		`-`
	`132`	`+`
`133`	`133`	`}`
`134`	`134`	`stk.push(nums[i]);`
`135`	`135`	`}`
Original file line number	Diff line number	Diff line change
`@@ -24,7 +24,6 @@ class Solution {`
`24`	`24`	`}`
`25`	`25`	`if (!stk.empty()) {`
`26`	`26`	`ans[i] = stk.top();`
`27`		`-`
`28`	`27`	`}`
`29`	`28`	`stk.push(nums[i]);`
`30`	`29`	`}`
Original file line number	Diff line number	Diff line change
`@@ -6,7 +6,9 @@ public List<String> removeSubfolders(String[] folder) {`
`6`	`6`	`for (int i = 1; i < folder.length; ++i) {`
`7`	`7`	`int m = ans.get(ans.size() - 1).length();`
`8`	`8`	`int n = folder[i].length();`
`9`		`- if (m >= n \|\| !(ans.get(ans.size() - 1).equals(folder[i].substring(0, m)) && folder[i].charAt(m) == '/')) {`
	`9`	`+ if (m >= n`
	`10`	`+ \|\| !(ans.get(ans.size() - 1).equals(folder[i].substring(0, m))`
	`11`	`+ && folder[i].charAt(m) == '/')) {`
`10`	`12`	`ans.add(folder[i]);`
`11`	`13`	`}`
`12`	`14`	`}`
Original file line number	Diff line number	Diff line change
`@@ -123,7 +123,6 @@ class Leaderboard {`
`123`	`123`	`private TreeMap<Integer, Integer> rank = new TreeMap<>((a, b) -> b - a);`
`124`	`124`
`125`	`125`	`public Leaderboard() {`
`126`		`-`
`127`	`126`	`}`
`128`	`127`
`129`	`128`	`public void addScore(int playerId, int score) {`
Original file line number	Diff line number	Diff line change
`@@ -94,18 +94,17 @@ class Leaderboard {`
`94`	`94`	`private TreeMap<Integer, Integer> rank = new TreeMap<>((a, b) -> b - a);`
`95`	`95`
`96`	`96`	`public Leaderboard() {`
`97`		`-`
`98`	`97`	`}`
`99`		`-`
	`98`	`+`
`100`	`99`	`public void addScore(int playerId, int score) {`
`101`	`100`	`d.merge(playerId, score, Integer::sum);`
`102`	`101`	`int newScore = d.get(playerId);`
`103`	`102`	`if (newScore != score) {`
`104`		`- rank.merge(newScore - score, -1, Integer::sum);`
	`103`	`+ rank.merge(newScore - score, -1, Integer::sum);`
`105`	`104`	`}`
`106`	`105`	`rank.merge(newScore, 1, Integer::sum);`
`107`	`106`	`}`
`108`		`-`
	`107`	`+`
`109`	`108`	`public int top(int K) {`
`110`	`109`	`int ans = 0;`
`111`	`110`	`for (var e : rank.entrySet()) {`
`@@ -119,7 +118,7 @@ class Leaderboard {`
`119`	`118`	`}`
`120`	`119`	`return ans;`
`121`	`120`	`}`
`122`		`-`
	`121`	`+`
`123`	`122`	`public void reset(int playerId) {`
`124`	`123`	`int score = d.remove(playerId);`
`125`	`124`	`if (rank.merge(score, -1, Integer::sum) == 0) {`
`@@ -145,7 +144,7 @@ public:`
`145`	`144`	`Leaderboard() {`
`146`	`145`
`147`	`146`	`}`
`148`		`-`
	`147`	`+`
`149`	`148`	`void addScore(int playerId, int score) {`
`150`	`149`	`d[playerId] += score;`
`151`	`150`	`int newScore = d[playerId];`
`@@ -154,7 +153,7 @@ public:`
`154`	`153`	`}`
`155`	`154`	`rank.insert(newScore);`
`156`	`155`	`}`
`157`		`-`
	`156`	`+`
`158`	`157`	`int top(int K) {`
`159`	`158`	`int ans = 0;`
`160`	`159`	`for (auto& x : rank) {`
`@@ -165,7 +164,7 @@ public:`
`165`	`164`	`}`
`166`	`165`	`return ans;`
`167`	`166`	`}`
`168`		`-`
	`167`	`+`
`169`	`168`	`void reset(int playerId) {`
`170`	`169`	`int score = d[playerId];`
`171`	`170`	`d.erase(playerId);`
Original file line number	Diff line number	Diff line change
`@@ -1,9 +1,8 @@`
`1`	`1`	`class Leaderboard {`
`2`	`2`	`public:`
`3`	`3`	`Leaderboard() {`
`4`		`-`
`5`	`4`	`}`
`6`		`-`
	`5`	`+`
`7`	`6`	`void addScore(int playerId, int score) {`
`8`	`7`	`d[playerId] += score;`
`9`	`8`	`int newScore = d[playerId];`
`@@ -12,7 +11,7 @@ class Leaderboard {`
`12`	`11`	`}`
`13`	`12`	`rank.insert(newScore);`
`14`	`13`	`}`
`15`		`-`
	`14`	`+`
`16`	`15`	`int top(int K) {`
`17`	`16`	`int ans = 0;`
`18`	`17`	`for (auto& x : rank) {`
`@@ -23,7 +22,7 @@ class Leaderboard {`
`23`	`22`	`}`
`24`	`23`	`return ans;`
`25`	`24`	`}`
`26`		`-`
	`25`	`+`
`27`	`26`	`void reset(int playerId) {`
`28`	`27`	`int score = d[playerId];`
`29`	`28`	`d.erase(playerId);`