feat: update script

Author: acbin

main.py

@@ -2,23 +2,41 @@
 import os
 import re
 
-code_block_dict = {
-    "python": ("Python3", "py"),
+sorted_suffixes = [
+    "py",
+    "java",
+    "cpp",
+    "go",
+    "ts",
+    "rs",
+    "js",
+    "cs",
+    "php",
+    "c",
+    "scala",
+    "swift",
+    "rb",
+    "kt",
+    "nim",
+    "sql",
+]
+code_dict = {
+    "py": ("Python3", "python"),
     "java": ("Java", "java"),
     "cpp": ("C++", "cpp"),
-    "c": ("C", "c"),
     "go": ("Go", "go"),
     "ts": ("TypeScript", "ts"),
+    "rs": ("Rust", "rust"),
     "js": ("JavaScript", "js"),
-    "php": ("PHP", "php"),
     "cs": ("C#", "cs"),
-    "rust": ("Rust", "rs"),
-    "sql": ("MySQL", "sql"),
-    "nim": ("Nim", "nim"),
+    "php": ("PHP", "php"),
+    "c": ("C", "c"),
     "scala": ("Scala", "scala"),
     "swift": ("Swift", "swift"),
     "rb": ("Ruby", "rb"),
-    "kotlin": ("Kotlin", "kt"),
+    "kt": ("Kotlin", "kotlin"),
+    "nim": ("Nim", "nim"),
+    "sql": ("MySQL", "sql"),
 }
 
 
@@ -42,7 +60,7 @@ def extract_code():
         if i == -1:
             continue
         content = content[i + len(mark) :]
-        for suf, (_, suffix) in code_block_dict.items():
+        for suffix, (_, suf) in code_dict.items():
             res = re.findall(f"```{suf}\n(.*?)```", content, re.S)
             if not res:
                 continue
@@ -111,11 +129,36 @@ def extract_solution_paragraph():
                 ["**Solution 1:", "**Solution 2:", "**Solution 3:", "**Solution 4:"],
             )
 
+        prefix = path[: path.rfind("/")]
+        for i in range(1, 5):
+            codes = []
+            for suf in sorted_suffixes:
+                seq = '' if i == 1 else str(i)
+                file_name = f"{prefix}/Solution{seq}.{suf}"
+                try:
+                    with open(file_name, "r", encoding="utf-8") as f:
+                        code = f.read().strip()
+                        code = '```' + code_dict[suf][1] + '\n' + code + '\n```'
+                        codes.append(code)
+                except:
+                    continue
+            if codes:
+                if i > len(blocks):
+                    seq_dict = {1: '一', 2: '二', 3: '三', 4: '四'}
+                    title = f"### 方法{seq_dict[i]}" if is_cn else f"### Solution {i}"
+                    block = title + '\n\n' + '\n\n'.join(codes)
+                    blocks.append(block)
+                else:
+                    block = blocks[i - 1] + '\n\n' + '\n\n'.join(codes)
+                    blocks[i - 1] = block
+
         if blocks:
-            prefix = path[: path.rfind("/")]
-            name = f"{prefix}/Solution.md" if is_cn else f"{prefix}/Solution_EN.md"
-            with open(name, "w", encoding="utf-8") as f:
-                f.write("\n\n".join(blocks))
+            start = '## 解法' if is_cn else '## Solutions'
+            content = (
+                content[: content.find(start)] + start + '\n\n' + '\n\n'.join(blocks)
+            )
+            with open(path, "w", encoding="utf-8") as f:
+                f.write(content)
 
 
 if __name__ == "__main__":

solution/1400-1499/1483.Kth Ancestor of a Tree Node/README.md

@@ -246,7 +246,6 @@ func (this *TreeAncestor) GetKthAncestor(node int, k int) int {
 ### **TypeScript**
 
 ```ts
-class TreeAncestor {
 class TreeAncestor {
     private p: number[][];
 

solution/1400-1499/1483.Kth Ancestor of a Tree Node/Solution.cpp

@@ -35,4 +35,4 @@ class TreeAncestor {
  * Your TreeAncestor object will be instantiated and called as such:
  * TreeAncestor* obj = new TreeAncestor(n, parent);
  * int param_1 = obj->getKthAncestor(node,k);
- */
+ */

solution/1400-1499/1483.Kth Ancestor of a Tree Node/Solution.go

@@ -37,4 +37,4 @@ func (this *TreeAncestor) GetKthAncestor(node int, k int) int {
  * Your TreeAncestor object will be instantiated and called as such:
  * obj := Constructor(n, parent);
  * param_1 := obj.GetKthAncestor(node,k);
- */
+ */

solution/1400-1499/1483.Kth Ancestor of a Tree Node/Solution.java

@@ -36,4 +36,4 @@ public int getKthAncestor(int node, int k) {
  * Your TreeAncestor object will be instantiated and called as such:
  * TreeAncestor obj = new TreeAncestor(n, parent);
  * int param_1 = obj.getKthAncestor(node,k);
- */
+ */

solution/1700-1799/1774.Closest Dessert Cost/Solution.js

@@ -0,0 +1,21 @@
+const closestCost = function (baseCosts, toppingCosts, target) {
+    let closestDessertCost = -Infinity;
+    function dfs(dessertCost, j) {
+        const tarCurrDiff = Math.abs(target - dessertCost);
+        const tarCloseDiff = Math.abs(target - closestDessertCost);
+        if (tarCurrDiff < tarCloseDiff) {
+            closestDessertCost = dessertCost;
+        } else if (tarCurrDiff === tarCloseDiff && dessertCost < closestDessertCost) {
+            closestDessertCost = dessertCost;
+        }
+        if (dessertCost > target) return;
+        if (j === toppingCosts.length) return;
+        for (let count = 0; count <= 2; count++) {
+            dfs(dessertCost + count * toppingCosts[j], j + 1);
+        }
+    }
+    for (let i = 0; i < baseCosts.length; i++) {
+        dfs(baseCosts[i], 0);
+    }
+    return closestDessertCost;
+};

solution/2200-2299/2225.Find Players With Zero or One Losses/Solution2.js

@@ -0,0 +1,27 @@
+/**
+ * @param {number[][]} matches
+ * @return {number[][]}
+ */
+var findWinners = function (matches) {
+    const onlyWins = new Set(),
+        oneLose = new Set(),
+        moreLosses = new Set();
+
+    for (const [winner, loser] of matches) {
+        if (!moreLosses.has(loser)) {
+            if (oneLose.has(loser)) {
+                oneLose.delete(loser);
+                moreLosses.add(loser);
+            } else {
+                onlyWins.delete(loser);
+                oneLose.add(loser);
+            }
+        }
+
+        if (!moreLosses.has(winner) && !oneLose.has(winner)) {
+            onlyWins.add(winner);
+        }
+    }
+
+    return [[...onlyWins].sort((a, b) => a - b), [...oneLose].sort((a, b) => a - b)];
+};

solution/3000-3099/3007.Maximum Number That Sum of the Prices Is Less Than or Equal to K/Solution.cpp

@@ -1,38 +1,38 @@
-class Solution {
-public:
-    long long findMaximumNumber(long long k, int x) {
-        using ll = long long;
-        ll l = 1, r = 1e17;
-        ll num = 0;
-        ll f[65][65];
-        function<ll(int, int, bool)> dfs = [&](int pos, int cnt, bool limit) -> ll {
-            if (pos == 0) {
-                return cnt;
-            }
-            if (!limit && f[pos][cnt] != -1) {
-                return f[pos][cnt];
-            }
-            int up = limit ? num >> (pos - 1) & 1 : 1;
-            ll ans = 0;
-            for (int i = 0; i <= up; ++i) {
-                ans += dfs(pos - 1, cnt + (i == 1 && pos % x == 0), limit && i == up);
-            }
-            if (!limit) {
-                f[pos][cnt] = ans;
-            }
-            return ans;
-        };
-        while (l < r) {
-            ll mid = (l + r + 1) >> 1;
-            num = mid;
-            memset(f, -1, sizeof(f));
-            int pos = 64 - __builtin_clzll(mid);
-            if (dfs(pos, 0, true) <= k) {
-                l = mid;
-            } else {
-                r = mid - 1;
-            }
-        }
-        return l;
-    }
+class Solution {
+public:
+    long long findMaximumNumber(long long k, int x) {
+        using ll = long long;
+        ll l = 1, r = 1e17;
+        ll num = 0;
+        ll f[65][65];
+        function<ll(int, int, bool)> dfs = [&](int pos, int cnt, bool limit) -> ll {
+            if (pos == 0) {
+                return cnt;
+            }
+            if (!limit && f[pos][cnt] != -1) {
+                return f[pos][cnt];
+            }
+            int up = limit ? num >> (pos - 1) & 1 : 1;
+            ll ans = 0;
+            for (int i = 0; i <= up; ++i) {
+                ans += dfs(pos - 1, cnt + (i == 1 && pos % x == 0), limit && i == up);
+            }
+            if (!limit) {
+                f[pos][cnt] = ans;
+            }
+            return ans;
+        };
+        while (l < r) {
+            ll mid = (l + r + 1) >> 1;
+            num = mid;
+            memset(f, -1, sizeof(f));
+            int pos = 64 - __builtin_clzll(mid);
+            if (dfs(pos, 0, true) <= k) {
+                l = mid;
+            } else {
+                r = mid - 1;
+            }
+        }
+        return l;
+    }
 };

solution/3000-3099/3007.Maximum Number That Sum of the Prices Is Less Than or Equal to K/Solution.go

@@ -1,46 +1,46 @@
-func findMaximumNumber(k int64, x int) int64 {
-	var l, r int64 = 1, 1e17
-	var num int64
-	var f [65][65]int64
-	var dfs func(pos, cnt int, limit bool) int64
-	dfs = func(pos, cnt int, limit bool) int64 {
-		if pos == 0 {
-			return int64(cnt)
-		}
-		if !limit && f[pos][cnt] != -1 {
-			return f[pos][cnt]
-		}
-		var ans int64
-		up := 1
-		if limit {
-			up = int(num >> (pos - 1) & 1)
-		}
-		for i := 0; i <= up; i++ {
-			v := cnt
-			if i == 1 && pos%x == 0 {
-				v++
-			}
-			ans += dfs(pos-1, v, limit && i == up)
-		}
-		if !limit {
-			f[pos][cnt] = ans
-		}
-		return ans
-	}
-	for l < r {
-		mid := (l + r + 1) >> 1
-		num = mid
-		m := bits.Len(uint(num))
-		for i := range f {
-			for j := range f[i] {
-				f[i][j] = -1
-			}
-		}
-		if dfs(m, 0, true) <= k {
-			l = mid
-		} else {
-			r = mid - 1
-		}
-	}
-	return l
+func findMaximumNumber(k int64, x int) int64 {
+	var l, r int64 = 1, 1e17
+	var num int64
+	var f [65][65]int64
+	var dfs func(pos, cnt int, limit bool) int64
+	dfs = func(pos, cnt int, limit bool) int64 {
+		if pos == 0 {
+			return int64(cnt)
+		}
+		if !limit && f[pos][cnt] != -1 {
+			return f[pos][cnt]
+		}
+		var ans int64
+		up := 1
+		if limit {
+			up = int(num >> (pos - 1) & 1)
+		}
+		for i := 0; i <= up; i++ {
+			v := cnt
+			if i == 1 && pos%x == 0 {
+				v++
+			}
+			ans += dfs(pos-1, v, limit && i == up)
+		}
+		if !limit {
+			f[pos][cnt] = ans
+		}
+		return ans
+	}
+	for l < r {
+		mid := (l + r + 1) >> 1
+		num = mid
+		m := bits.Len(uint(num))
+		for i := range f {
+			for j := range f[i] {
+				f[i][j] = -1
+			}
+		}
+		if dfs(m, 0, true) <= k {
+			l = mid
+		} else {
+			r = mid - 1
+		}
+	}
+	return l
 }