update: 添加问题“118.杨辉三角”的代码和题解(#1058)

* feat: test 后台子进程 - Mac上会后台继续运行
0118: - AC.cpp+py + Half.java (#1057)

cpp - AC,100.00%,5.38%
py - AC,100.00%,21.96%

* 0118: - AC.java+go + CE.rust (#1057)

java - AC,97.77%,33.33% （好冗长）
go - AC,100.00%,49.58%

* 0118: - AC.rust (#1057)

rust - AC,100.00%,80.39%

* update: 添加问题“118. 杨辉三角”的代码并更新其题解 (#1057)

* docs: en+jp yesterday (#1057)

* word: en words today (2025.08.03) (#1057)

* update: 添加问题“118.杨辉三角”的代码(并更新其题解) (#1058)

Signed-off-by: LetMeFly666 <[email protected]>

---------

Signed-off-by: LetMeFly666 <[email protected]>

Author: LetMeFly666

.vscode/settings.json

@@ -89,7 +89,10 @@
         "__hash_table": "cpp",
         "__split_buffer": "cpp",
         "__tree": "cpp",
-        "queue": "cpp"
+        "queue": "cpp",
+        "span": "cpp",
+        "__locale": "cpp",
+        "ios": "cpp"
     },
     "editor.mouseWheelZoom": true,
     "workbench.tree.enableStickyScroll": true,

Codes/0118-pascals-triangle_20250801.cpp

@@ -0,0 +1,25 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-08-01 23:51:32
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-08-01 23:55:15
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    vector<vector<int>> generate(int numRows) {
+        vector<vector<int>> ans(numRows);
+        ans[0].push_back(1);
+        for (int i = 1; i < numRows; i++) {
+            ans[i].push_back(1);
+            for (int j = 1; j < i; j++) {
+                ans[i].push_back(ans[i - 1][j - 1] + ans[i - 1][j]);
+            }
+            ans[i].push_back(1);
+        }
+        return ans;
+    }
+};

Codes/0118-pascals-triangle_20250801.go

@@ -0,0 +1,21 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-08-01 23:51:32
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-08-02 13:12:32
+ */
+package main
+
+func generate(numRows int) [][]int {
+    ans := make([][]int, numRows)
+	ans[0] = []int{1}
+	for i := 1; i < numRows; i++ {
+		ans[i] = make([]int, i + 1)
+		ans[i][0] = 1
+		for j := 1; j < i; j++ {
+			ans[i][j] = ans[i - 1][j - 1] + ans[i - 1][j]
+		}
+		ans[i][i] = 1
+	}
+	return ans
+}

Codes/0118-pascals-triangle_20250801.java

@@ -0,0 +1,24 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-08-01 23:51:32
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-08-02 12:47:48
+ */
+import java.util.List;
+import java.util.ArrayList;
+
+class Solution {
+    public List<List<Integer>> generate(int numRows) {
+        List<List<Integer>> ans = new ArrayList<>(numRows);
+        ans.add(List.of(1));
+        for (int i = 1; i < numRows; i++) {
+            ans.add(new ArrayList<>(i + 1));
+            ans.get(i).add(1);
+            for (int j = 1; j < i; j++) {
+                ans.get(i).add(ans.get(i - 1).get(j - 1) + ans.get(i - 1).get(j));
+            }
+            ans.get(i).add(1);
+        }
+        return ans;
+    }
+}

Codes/0118-pascals-triangle_20250801.py

@@ -0,0 +1,16 @@
+'''
+Author: LetMeFly
+Date: 2025-08-01 23:51:32
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-08-02 00:01:53
+'''
+from typing import List
+
+class Solution:
+    def generate(self, numRows: int) -> List[List[int]]:
+        ans = [[1] for _ in range(numRows)]
+        for i in range(1, numRows):
+            for j in range(1, i):
+                ans[i].append(ans[i - 1][j - 1] + ans[i - 1][j])
+            ans[i].append(1)
+        return ans

Codes/0118-pascals-triangle_20250801.rs

@@ -0,0 +1,19 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-08-01 23:51:32
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-08-02 13:25:16
+ */
+impl Solution {
+    pub fn generate(num_rows: i32) -> Vec<Vec<i32>> {
+        let size = num_rows as usize;
+        let mut ans = vec![vec![]; size];
+        for i in 0..size {
+            ans[i].resize(i + 1, 1);
+            for j in 1..i {
+                ans[i][j] = ans[i - 1][j - 1] + ans[i - 1][j];
+            }
+        }
+        ans
+    }
+}

Solutions/LeetCode 0118.杨辉三角.md

@@ -90,7 +90,107 @@ public:
 
 运行结果：耗时还挺少
 
-![挺快的这次](https://cors.tisfy.eu.org/https://img-blog.csdnimg.cn/062fef3809fd4c878ac408f98b2f2d24.jpeg#pic_center)
+![挺快的这次](https://cors.letmefly.xyz/https://img-blog.csdnimg.cn/062fef3809fd4c878ac408f98b2f2d24.jpeg#pic_center)
+
+#### Python
+
+```python
+'''
+Author: LetMeFly
+Date: 2025-08-01 23:51:32
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-08-02 00:01:53
+'''
+from typing import List
+
+class Solution:
+    def generate(self, numRows: int) -> List[List[int]]:
+        ans = [[1] for _ in range(numRows)]
+        for i in range(1, numRows):
+            for j in range(1, i):
+                ans[i].append(ans[i - 1][j - 1] + ans[i - 1][j])
+            ans[i].append(1)
+        return ans
+```
+
+#### Java
+
+```java
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-08-01 23:51:32
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-08-02 12:47:48
+ */
+import java.util.List;
+import java.util.ArrayList;
+
+class Solution {
+    public List<List<Integer>> generate(int numRows) {
+        List<List<Integer>> ans = new ArrayList<>(numRows);
+        ans.add(List.of(1));
+        for (int i = 1; i < numRows; i++) {
+            ans.add(new ArrayList<>(i + 1));
+            ans.get(i).add(1);
+            for (int j = 1; j < i; j++) {
+                ans.get(i).add(ans.get(i - 1).get(j - 1) + ans.get(i - 1).get(j));
+            }
+            ans.get(i).add(1);
+        }
+        return ans;
+    }
+}
+```
+
+#### Go
+
+```go
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-08-01 23:51:32
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-08-02 13:12:32
+ */
+package main
+
+func generate(numRows int) [][]int {
+    ans := make([][]int, numRows)
+    ans[0] = []int{1}
+    for i := 1; i < numRows; i++ {
+        ans[i] = make([]int, i + 1)
+        ans[i][0] = 1
+        for j := 1; j < i; j++ {
+            ans[i][j] = ans[i - 1][j - 1] + ans[i - 1][j]
+        }
+        ans[i][i] = 1
+    }
+    return ans
+}
+```
+
+#### Rust
+
+```rust
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-08-01 23:51:32
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-08-02 13:25:16
+ */
+impl Solution {
+    pub fn generate(num_rows: i32) -> Vec<Vec<i32>> {
+        let size = num_rows as usize;
+        let mut ans = vec![vec![]; size];
+        for i in 0..size {
+            ans[i].resize(i + 1, 1);
+            for j in 1..i {
+                ans[i][j] = ans[i - 1][j - 1] + ans[i - 1][j];
+            }
+        }
+        ans
+    }
+}
+```
 
 > 同步发文于CSDN，原创不易，转载请附上[原文链接](https://blog.letmefly.xyz/2022/07/17/LeetCode%200118.%E6%9D%A8%E8%BE%89%E4%B8%89%E8%A7%92/)哦~
 > Tisfy：[https://letmefly.blog.csdn.net/article/details/125829159](https://letmefly.blog.csdn.net/article/details/125829159)

Solutions/Other-English-LearningNotes-SomeWords.md

@@ -1294,7 +1294,7 @@ categories: [自用]
 |||
 |alienate|v. 离间，使疏远，使不友好，使（与某群体）格格不入|
 |fort|n. 要塞；堡垒；兵营，军营|
-|bulletin|n. 公告，告示；新闻快报；简报|
+|<font color="#28bea0" title="二次复习">bulletin</font>|n. 公告，告示；新闻快报；简报|
 |stevedore|n. 码头工人<br/>装船卸货|
 |tar|n. 焦油，沥青<br/>用沥青抹，用柏油涂<br/>adj. 涂油柏油的|
 |||
@@ -1326,6 +1326,13 @@ categories: [自用]
 |embroider|v. 刺绣，加以润饰，对...添枝加叶|
 |lipstick|n. 口红，唇膏，唇彩|
 |governess|n. 家庭女教师|
+|||
+|convict|v. 定罪<br/>n. 服刑囚犯，已决犯|
+|bugle|n. 号角，军号，喇叭|
+|||
+|dew|n. 露水<br/>v. 喷湿，结露水|
+|impartial|adj. 无私的，公平的，中立的|
+|centigrade|n. 摄氏温度<br/>adj. 摄氏的|
 
 这个web要是能设计得可以闭眼(完全不睁眼)键盘控制背单词就好了。
 

Solutions/Other-Japanese-LearningNotes.md

@@ -162,6 +162,7 @@ xx型
 |買い(かい)|买|
 |入れ(いれ)|预约(v.)|
 |予約(よやく)|预约(n.)|
+|セール(sale)|促销|
 |返品(へんぴん)|退货|
 |捨て(すて)|仍|
 |交換(こうかん)|更换|
@@ -333,6 +334,7 @@ xx型
 |厚い(あつい)|厚的|
 |薄い(うすい)|薄的|
 |浮わ浮わ(ふわふわ)|软的|
+|柔らかい(やわらかい)|柔软的|
 |硬い(かたい)|硬的|
 |ふとい|粗的|
 |細い(ほそい)|细的|
@@ -555,7 +557,9 @@ xx型
 |服(ふく)|衣服|
 |洋服(ようふく)|衣服|
 |ドレス(dress)|裙子/礼服|
+|ワンピース(one-piece)|连衣裙|
 |ネクタイ|领带|
+|マフラー(muffler)|围巾|
 |スーツ|西服|
 |ハンカチ|手帕|
 |帽子(ぼうし)|帽子|
@@ -980,6 +984,7 @@ xx型
 |お勧め(おすすめ)|推荐|
 |大丈夫(だいじょうぶ)|没问题|
 |確認(かくにん)|确认|
+|似合い(にあい)|合适|
 |||
 |牛肉(ぎゅうにく)|牛肉|
 |豚肉(ぶたにく)|猪肉|

newSolution.py

@@ -2,7 +2,7 @@
 Author: LetMeFly
 Date: 2022-07-03 11:21:14
 LastEditors: LetMeFly.xyz
-LastEditTime: 2025-07-31 10:47:13
+LastEditTime: 2025-08-03 20:07:03
 Command: python newSolution.py 102. 二叉树的层序遍历
 What's more: 当前仅支持数字开头的题目
 What's more: 代码结构写的很混乱 - 想单文件实现所有操作
@@ -99,6 +99,7 @@ def getPlatform():
     issueNum = int(issueCreateResult.split('\n')[0].split('/')[-1])
 else:
     os.popen(f'gh issue edit {issueNum} --add-label "solving"')  # 这里暂不read等待popen执行完毕，这里的小异步是被允许的
+    os.popen(f'gh issue comment {issueNum} -b "hello #{issueNum} you are not alone now."')
 
 input('代码写完后按回车生成题解模板：')
 
@@ -185,31 +186,33 @@ def refreshPublistTime(solution: str) -> str:
 print(solution)
 
 solutionName = "Solutions/LeetCode {0:04d}.{1}.md".format(num, title)
-with open(solutionName, "x", encoding="utf-8") as f:
-    f.write(solution)
+solutionExists = os.path.exists(solutionName)
+if not solutionExists:
+    with open(solutionName, "w", encoding="utf-8") as f:
+        f.write(solution)
 
-print("请编辑题解: “{0}”，注意不要更改文件前5行".format(solutionName))
+    print("请编辑题解: “{0}”，注意不要更改文件前5行".format(solutionName))
 
-print("请去掉可能的由其他插件自动生成的头部注释信息，并保存你所编辑的题解")
-csdnid = input("请输入CSDN题解文章的id(11022152)：")
-solutionURLcs = "https://letmefly.blog.csdn.net/article/details/{0}".format(csdnid)
+    print("请去掉可能的由其他插件自动生成的头部注释信息，并保存你所编辑的题解")
+    csdnid = input("请输入CSDN题解文章的id(11022152)：")
+    solutionURLcs = "https://letmefly.blog.csdn.net/article/details/{0}".format(csdnid)
 
-with open(solutionName, "r", encoding="utf-8") as f:
-    solution = f.read()
+    with open(solutionName, "r", encoding="utf-8") as f:
+        solution = f.read()
 
-solution = solution.replace("--------------------------", csdnid)
-# solution = solution.replace("--------------------------", csdnid)
+    solution = solution.replace("--------------------------", csdnid)
+    # solution = solution.replace("--------------------------", csdnid)
 
-with open(solutionName, "w", encoding="utf-8") as f:
-    f.write(solution)
+    with open(solutionName, "w", encoding="utf-8") as f:
+        f.write(solution)
 
-print("请重新复制所有的题解内容，并粘贴到CSDN中发布")
-print("请在LeetCode中新建、编辑并发布题解")
+    print("请重新复制所有的题解内容，并粘贴到CSDN中发布")
+    print("请在LeetCode中新建、编辑并发布题解")
 
-solutionURLlc = input("LeetCode题解的url: ")
+    solutionURLlc = input("LeetCode题解的url: ")
 
-with open("README.md", "r", encoding="utf-8") as f:
-    readme = f.read()
+    with open("README.md", "r", encoding="utf-8") as f:
+        readme = f.read()
 
 def readmeNewLine(readme: str) -> str:
     splited = readme.split("\n")
@@ -260,10 +263,16 @@ def getProblemUrl():
     splited.insert(i, generateNewLine())
     return "\n".join(splited)
 
-readme = readmeNewLine(readme)
-print(readme)
-with open("README.md", "w", encoding="utf-8") as f:
-    f.write(readme)
+if not solutionExists:
+    readme = readmeNewLine(readme)
+    print(readme)
+    with open("README.md", "w", encoding="utf-8") as f:
+        f.write(readme)
+
+if solutionExists:
+    gitCommitMsgPrefix = f'update: 添加问题“{num}.{title}”的代码(并更新其题解)'
+else:
+    gitCommitMsgPrefix = f'update: 添加问题“{num}.{title}”的代码和题解'
 
 # commit push pr merge delete-branch
 os.system('git add .')
@@ -277,7 +286,7 @@ def getPrOrIssueMaxNum(prOrIssue: str) -> int:  # (#811)
     return data[0]['number']
 lastNum = max(getPrOrIssueMaxNum('pr'), getPrOrIssueMaxNum('issue'))
 print(lastNum)
-commitMsg = f'update: 添加问题“{num}.{title}”的代码和题解(#{lastNum + 1})'
+commitMsg = f'{gitCommitMsgPrefix} (#{lastNum + 1})'
 if os.path.exists('.commitmsg') and os.path.isfile('.commitmsg'):  # (#795)
     with open('.commitmsg', 'r', encoding='utf-8') as f:
         commitMsgFromfile = f.read()
@@ -286,7 +295,7 @@ def getPrOrIssueMaxNum(prOrIssue: str) -> int:  # (#811)
     commitMsg += commitMsgFromfile
 subprocess.run(['git', 'commit', '-s', '-m', commitMsg])  # os.system('git commit -s -m "{msg}"')的话没法评论多行
 os.system(f'git push --set-upstream origin {num}')
-cmd = f'gh pr create -H {num} -t "添加问题“{num}.{title}”的代码和题解" -b "By [newSolution.py](https://github.com/LetMeFly666/LeetCode/blob/{lastSHA}/newSolution.py) using GH on {getPlatform()} | close: #{issueNum}" -l "题解" -a "@me"'  # -H branch可能是 新版/旧版/Mac 所需的属性，并没有默认使用当前分支诶
+cmd = f'gh pr create -H {num} -t "{gitCommitMsgPrefix}" -b "By [newSolution.py](https://github.com/LetMeFly666/LeetCode/blob/{lastSHA}/newSolution.py) using GH on {getPlatform()} | close: #{issueNum}" -l "题解" -a "@me"'  # -H branch可能是 新版/旧版/Mac 所需的属性，并没有默认使用当前分支诶
 print(cmd)
 prResult = os.popen(cmd).read()
 print(prResult)