update: 添加问题“66.加一”的代码和题解 (#1296)

LetMeFly666 · web-flow · commit 10a452e27ec3 · 2026-01-01T18:40:40.000+08:00
* word: en * 66: WA.cpp * 66: AC.cpp (#1295) - AC,100.00%,75.94% * 66: AC.pyx2+java+rust+go (#1295) py - AC,100.00%,84.44% py - oneline,int list, AC,100.00%,93.49% java - AC,100.00%,8.27% rust - AC,100.00%,26.56% go - AC,100.00%,79.71% * update: 添加问题“66.加一”的代码和题解 (#1296) Signed-off-by: LetMeFly666 <814114971@qq.com> * 1problem1day: todo * 1problem1day: only when `solving` label --------- Signed-off-by: LetMeFly666 <814114971@qq.com>
diff --git a/.github/workflows/1problem1day-autoGenIssueEveryday.yml b/.github/workflows/1problem1day-autoGenIssueEveryday.yml
@@ -25,7 +25,7 @@ jobs:
             -H 'Content-Type: application/json' \
             -d "{
               \"query\":\"query dailyQuestionRecords(\$year:Int!,\$month:Int!){dailyQuestionRecords(year:\$year,month:\$month){date question{questionFrontendId titleSlug translatedTitle}}}\",
-              \"variables\":{\"year\":$year,\"month\":$month}
+              \"variables\":{\"year\":\"$year\",\"month\":\"$month\"}
             }" \
           | jq -r --arg d "$date" '
             .data.dailyQuestionRecords[]
diff --git a/.github/workflows/1problem1day-label.yml b/.github/workflows/1problem1day-label.yml
@@ -35,6 +35,14 @@ jobs:
           echo "label(event)  = ${{ github.event.label.name }}"
           echo "======================="
 
+          # 非solving标签改动时退出
+          label_event="${{ github.event.label.name }}"
+          if [[ "$label_event" != "solving" ]]; then
+            echo "Label '$label_event' is not 'solving', skip workflow"
+            echo "skip=true" >> $GITHUB_OUTPUT
+            exit 0
+          fi
+
           issue_node_id="${{ github.event.issue.node_id }}"
           issue_state="${{ github.event.issue.state }}"
 
diff --git a/Codes/0066-plus-one.cpp b/Codes/0066-plus-one.cpp
@@ -0,0 +1,25 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-01-01 15:40:30
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-01-01 15:44:13
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    vector<int> plusOne(vector<int>& digits) {
+        int cnt = 1;
+        for (int i = digits.size() - 1; i >= 0; i--) {
+            digits[i] += cnt;
+            cnt = digits[i] / 10;
+            digits[i] %= 10;
+        }
+        if (cnt) {
+            digits.insert(digits.begin(), cnt);
+        }
+        return digits;
+    }
+};
diff --git a/Codes/0066-plus-one.go b/Codes/0066-plus-one.go
@@ -0,0 +1,20 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-01-01 15:40:30
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-01-01 16:09:18
+ */
+package main
+
+func plusOne(digits []int) []int {
+    cnt := 1
+    for i := len(digits) - 1; i >= 0; i-- {
+        digits[i] += cnt
+        cnt = digits[i] / 10
+        digits[i] %= 10
+    }
+    if cnt > 0 {
+        return append([]int{cnt}, digits...)
+    }
+    return digits
+}
diff --git a/Codes/0066-plus-one.java b/Codes/0066-plus-one.java
@@ -0,0 +1,25 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-01-01 15:40:30
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-01-01 15:59:15
+ */
+class Solution {
+    public int[] plusOne(int[] digits) {
+        int cnt = 1;
+        for (int i = digits.length - 1; i >= 0; i--) {
+            digits[i] += cnt;
+            cnt = digits[i] / 10;
+            digits[i] %= 10;
+        }
+        if (cnt > 0) {
+            int[] ans = new int[digits.length + 1];
+            ans[0] = cnt;
+            for (int i = 0; i < digits.length; i++) {
+                ans[i + 1] = digits[i];
+            }
+            return ans;
+        }
+        return digits;
+    }
+}
diff --git a/Codes/0066-plus-one.py b/Codes/0066-plus-one.py
@@ -0,0 +1,18 @@
+'''
+Author: LetMeFly
+Date: 2026-01-01 15:40:30
+LastEditors: LetMeFly.xyz
+LastEditTime: 2026-01-01 15:54:44
+'''
+from typing import List
+
+class Solution:
+    def plusOne(self, digits: List[int]) -> List[int]:
+        cnt = 1
+        for i in range(len(digits) - 1, -1, -1):
+            digits[i] += cnt
+            cnt = digits[i] // 10
+            digits[i] %= 10
+        if cnt:
+            digits = [1] + digits
+        return digits
diff --git a/Codes/0066-plus-one.rs b/Codes/0066-plus-one.rs
@@ -0,0 +1,20 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-01-01 15:40:30
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-01-01 16:06:45
+ */
+impl Solution {
+    pub fn plus_one(mut digits: Vec<i32>) -> Vec<i32> {
+        let mut cnt: i32 = 1;
+        for i in (0..digits.len()).rev() {
+            digits[i] += cnt;
+            cnt = digits[i] / 10;
+            digits[i] %= 10;
+        }
+        if cnt > 0 {
+            digits.insert(0, cnt);
+        }
+        digits
+    }
+}
diff --git a/Codes/0066-plus-one_one-line-int-list.py b/Codes/0066-plus-one_one-line-int-list.py
@@ -0,0 +1,15 @@
+'''
+Author: LetMeFly
+Date: 2026-01-01 15:54:45
+LastEditors: LetMeFly.xyz
+LastEditTime: 2026-01-01 16:03:01
+'''
+from typing import List
+
+class Solution:
+    def plusOne(self, digits: List[int]) -> List[int]:
+        return list(map(int, str(int(''.join(map(str, digits))) + 1)))
+
+if __name__ == '__main__':
+    sol = Solution()
+    print(sol.plusOne([1,2,3]))
diff --git a/Codes/lib.rs b/Codes/lib.rs
@@ -5,4 +5,4 @@
  * @LastEditTime: 2025-11-01 22:18:35
  */
 pub struct Solution;
-include!("3075-maximize-happiness-of-selected-children.rs");  // 这个fileName是会被脚本替换掉的
+include!("0066-plus-one.rs");  // 这个fileName是会被脚本替换掉的
diff --git a/README.md b/README.md
@@ -183,6 +183,7 @@
 |0059.螺旋矩阵II|中等|<a href="https://leetcode.cn/problems/spiral-matrix-ii/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/02/07/LeetCode%200059.%E8%9E%BA%E6%97%8B%E7%9F%A9%E9%98%B5II/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/145502589" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/spiral-matrix-ii/solutions/3066956/letmefly-59luo-xuan-ju-zhen-iiyou-zhi-da-vuyg/" target="_blank">LeetCode题解</a>|
 |0062.不同路径|中等|<a href="https://leetcode.cn/problems/unique-paths/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/11/26/LeetCode%200062.%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/128059055" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/unique-paths/solutions/1992721/letmefly-62bu-tong-lu-jing-liang-chong-f-e8tl/" target="_blank">LeetCode题解</a>|
 |0063.不同路径II|中等|<a href="https://leetcode.cn/problems/unique-paths-ii/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/02/08/LeetCode%200063.%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84II/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/145509662" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/unique-paths-ii/solutions/3067362/letmefly-63bu-tong-lu-jing-iidong-tai-gu-je2m/" target="_blank">LeetCode题解</a>|
+|0066.加一|简单|<a href="https://leetcode.cn/problems/plus-one/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2026/01/01/LeetCode%200066.%E5%8A%A0%E4%B8%80/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/156488092" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/plus-one/solutions/3870599/letmefly-66jia-yi-mo-ni-fu-jian-dan-ti-b-02dl/" target="_blank">LeetCode题解</a>|
 |0067.二进制求和|简单|<a href="https://leetcode.cn/problems/add-binary/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/07/14/LeetCode%200067.%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%B1%82%E5%92%8C/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/125793685" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/add-binary/solution/by-tisfy-o5z5/" target="_blank">LeetCode题解</a>|
 |0070.爬楼梯|简单|<a href="https://leetcode.cn/problems/climbing-stairs/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/12/10/LeetCode%200070.%E7%88%AC%E6%A5%BC%E6%A2%AF/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/134913892" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/climbing-stairs/solutions/2561558/letmefly-70pa-lou-ti-dong-tai-gui-hua-di-7d8m/" target="_blank">LeetCode题解</a>|
 |0080.删除有序数组中的重复项II|中等|<a href="https://leetcode.cn/problems/remove-duplicates-from-sorted-array-ii/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/02/09/LeetCode%200080.%E5%88%A0%E9%99%A4%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E9%A1%B9II/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/145528267" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/remove-duplicates-from-sorted-array-ii/solutions/3068455/letmefly-80shan-chu-you-xu-shu-zu-zhong-b1e2i/" target="_blank">LeetCode题解</a>|
diff --git a/Solutions/LeetCode 0066.加一.md b/Solutions/LeetCode 0066.加一.md
@@ -0,0 +1,204 @@
+---
+title: 66.加一：模拟（附简单题必备——Python一行版）
+date: 2026-01-01 16:11:02
+tags: [题解, LeetCode, 简单, 数组, 数学, 高精度, 高精度加法]
+categories: [题解, LeetCode]
+---
+
+# 【LetMeFly】66.加一：模拟（附简单题必备——Python一行版）
+
+力扣题目链接：[https://leetcode.cn/problems/plus-one/](https://leetcode.cn/problems/plus-one/)
+
+<p>给定一个表示 <strong>大整数</strong> 的整数数组 <code>digits</code>，其中 <code>digits[i]</code> 是整数的第 <code>i</code> 位数字。这些数字按从左到右，从最高位到最低位排列。这个大整数不包含任何前导 <code>0</code>。</p>
+
+<p>将大整数加 1，并返回结果的数字数组。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例&nbsp;1：</strong></p>
+
+<pre>
+<strong>输入：</strong>digits = [1,2,3]
+<strong>输出：</strong>[1,2,4]
+<strong>解释：</strong>输入数组表示数字 123。
+加 1 后得到 123 + 1 = 124。
+因此，结果应该是 [1,2,4]。
+</pre>
+
+<p><strong>示例&nbsp;2：</strong></p>
+
+<pre>
+<strong>输入：</strong>digits = [4,3,2,1]
+<strong>输出：</strong>[4,3,2,2]
+<strong>解释：</strong>输入数组表示数字 4321。
+加 1 后得到 4321 + 1 = 4322。
+因此，结果应该是 [4,3,2,2]。
+</pre>
+
+<p><strong>示例 3：</strong></p>
+
+<pre>
+<strong>输入：</strong>digits = [9]
+<strong>输出：</strong>[1,0]
+<strong>解释：</strong>输入数组表示数字 9。
+加 1 得到了 9 + 1 = 10。
+因此，结果应该是 [1,0]。
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= digits.length &lt;= 100</code></li>
+	<li><code>0 &lt;= digits[i] &lt;= 9</code></li>
+	<li><code>digits</code>&nbsp;不包含任何前导 <code>0</code>。</li>
+</ul>
+
+
+    
+## 解题方法：模拟
+
+使用一个初始值为$1$的整数`cnt`代表加法运算过程中的进位值，然后就可以愉快地开始模拟啦！
+
+幼儿园学习加法的过程中我们了解到，多位数加上一个个位数，将个位数加到多位数的个位，若大于$9$则不断向高位进位<span title="我的博客里面很少用GPT生成内容，包括这段回忆也是本人写的">。</span>
+
++ 时间复杂度$O(len(digits))$
++ 空间复杂度$O(1)$
+
+### AC代码
+
+#### C++
+
+```cpp
+/*
+ * @LastEditTime: 2026-01-01 15:44:13
+ */
+class Solution {
+public:
+    vector<int> plusOne(vector<int>& digits) {
+        int cnt = 1;
+        for (int i = digits.size() - 1; i >= 0; i--) {
+            digits[i] += cnt;
+            cnt = digits[i] / 10;
+            digits[i] %= 10;
+        }
+        if (cnt) {
+            digits.insert(digits.begin(), cnt);
+        }
+        return digits;
+    }
+};
+```
+
+#### Python
+
+```python
+'''
+LastEditTime: 2026-01-01 15:54:44
+'''
+from typing import List
+
+class Solution:
+    def plusOne(self, digits: List[int]) -> List[int]:
+        cnt = 1
+        for i in range(len(digits) - 1, -1, -1):
+            digits[i] += cnt
+            cnt = digits[i] // 10
+            digits[i] %= 10
+        if cnt:
+            digits = [1] + digits
+        return digits
+```
+
+#### Python - 一行版
+
+```python
+'''
+LastEditTime: 2026-01-01 16:03:01
+'''
+from typing import List
+
+class Solution:
+    def plusOne(self, digits: List[int]) -> List[int]:
+        return list(map(int, str(int(''.join(map(str, digits))) + 1)))
+
+# if __name__ == '__main__':
+#     sol = Solution()
+#     print(sol.plusOne([1,2,3]))
+```
+
+#### Java
+
+```java
+/*
+ * @LastEditTime: 2026-01-01 15:59:15
+ */
+class Solution {
+    public int[] plusOne(int[] digits) {
+        int cnt = 1;
+        for (int i = digits.length - 1; i >= 0; i--) {
+            digits[i] += cnt;
+            cnt = digits[i] / 10;
+            digits[i] %= 10;
+        }
+        if (cnt > 0) {
+            int[] ans = new int[digits.length + 1];
+            ans[0] = cnt;
+            for (int i = 0; i < digits.length; i++) {
+                ans[i + 1] = digits[i];
+            }
+            return ans;
+        }
+        return digits;
+    }
+}
+```
+
+#### Go
+
+```go
+/*
+ * @LastEditTime: 2026-01-01 16:09:18
+ */
+package main
+
+func plusOne(digits []int) []int {
+    cnt := 1
+    for i := len(digits) - 1; i >= 0; i-- {
+        digits[i] += cnt
+        cnt = digits[i] / 10
+        digits[i] %= 10
+    }
+    if cnt > 0 {
+        return append([]int{cnt}, digits...)
+    }
+    return digits
+}
+```
+
+#### Rust
+
+```rust
+/*
+ * @LastEditTime: 2026-01-01 16:06:45
+ */
+impl Solution {
+    pub fn plus_one(mut digits: Vec<i32>) -> Vec<i32> {
+        let mut cnt: i32 = 1;
+        for i in (0..digits.len()).rev() {
+            digits[i] += cnt;
+            cnt = digits[i] / 10;
+            digits[i] %= 10;
+        }
+        if cnt > 0 {
+            digits.insert(0, cnt);
+        }
+        digits
+    }
+}
+```
+
+> 同步发文于[CSDN](https://letmefly.blog.csdn.net/article/details/156488092)和我的[个人博客](https://blog.letmefly.xyz/)，原创不易，转载经作者同意后请附上[原文链接](https://blog.letmefly.xyz/2026/01/01/LeetCode%200066.%E5%8A%A0%E4%B8%80/)哦~
+>
+> 千篇源码题解[已开源](https://github.com/LetMeFly666/LeetCode)
diff --git a/Solutions/Other-English-LearningNotes-SomeWords.md b/Solutions/Other-English-LearningNotes-SomeWords.md
@@ -1708,6 +1708,10 @@ categories: [自用]
 |engraving|n. 版画，雕版印刷品，雕刻(术)|
 |||
 |ecstasy|n. 狂喜，陶醉，入迷；迷幻药|
+|||
+|sneeze|v. 打喷嚏<br/>n. 喷嚏，喷嚏声|
+|tenor|n. 男高音，大意，要旨，男高音歌手<br/>adj. 次中音的|
+|telex|n. 电报，电传机，电传收发机<br/>v. 发电报，以电报发文|
 
 + 这个web要是能设计得可以闭眼(完全不睁眼)键盘控制背单词就好了。
 + 也许可以加个AI用最近词编故事功能(返回接口中支持标注所使用单词高亮?)
diff --git a/demo.py b/demo.py
