update: 添加问题“2011.执行操作后的变量值”的代码(并更新其题解) (#1178)

LetMeFly666 · LetMeFly666 · commit b2aacf43a1db · 2025-10-20T19:00:19.000+08:00
Signed-off-by: LetMeFly666 &lt;814114971@qq.com&gt;
diff --git a/.commitmsg b/.commitmsg
diff --git a/Codes/2011-final-value-of-variable-after-performing-operations_20251020.cpp b/Codes/2011-final-value-of-variable-after-performing-operations_20251020.cpp
@@ -0,0 +1,20 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-10-20 18:44:35
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-10-20 18:46:29
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    int finalValueAfterOperations(vector<string>& operations) {
+        int ans = 0;
+        for (string& op : operations) {
+            ans += op[1] == '+' ? 1 : -1;
+        }
+        return ans;
+    }
+};
diff --git a/Codes/2011-final-value-of-variable-after-performing-operations_20251020.go b/Codes/2011-final-value-of-variable-after-performing-operations_20251020.go
@@ -0,0 +1,18 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-10-20 18:44:35
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-10-20 18:48:49
+ */
+package main
+
+func finalValueAfterOperations(operations []string) (ans int) {
+    for _, op := range operations {
+        if op[1] == '+' {
+            ans++;
+        } else {
+            ans--
+        }
+    }
+    return
+}
diff --git a/Codes/2011-final-value-of-variable-after-performing-operations_20251020.java b/Codes/2011-final-value-of-variable-after-performing-operations_20251020.java
@@ -0,0 +1,19 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-10-20 18:44:35
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-10-20 18:48:23
+ */
+class Solution {
+    public int finalValueAfterOperations(String[] operations) {
+        int ans = 0;
+        for (String op : operations) {
+            if (op.charAt(1) == '+') {
+                ans++;
+            } else {
+                ans--;
+            }
+        }
+        return ans;
+    }
+}
diff --git a/Codes/2011-final-value-of-variable-after-performing-operations_20251020.py b/Codes/2011-final-value-of-variable-after-performing-operations_20251020.py
@@ -0,0 +1,11 @@
+'''
+Author: LetMeFly
+Date: 2025-10-20 18:44:35
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-10-20 18:47:35
+'''
+from typing import List
+
+class Solution:
+    def finalValueAfterOperations(self, operations: List[str]) -> int:
+        return sum(1 if op[1] == '+' else -1 for op in operations)
diff --git a/Codes/2011-final-value-of-variable-after-performing-operations_20251020.rs b/Codes/2011-final-value-of-variable-after-performing-operations_20251020.rs
@@ -0,0 +1,19 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-10-20 18:44:35
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-10-20 18:56:38
+ */
+impl Solution {
+    pub fn final_value_after_operations(operations: Vec<String>) -> i32 {
+        let mut ans: i32 = 0;
+        for op in operations {
+            if op.as_bytes()[1] == b'+' {
+                ans += 1;  // cannot write as: ans++;
+            } else {
+                ans -= 1;
+            }
+        }
+        ans
+    }
+}
diff --git a/Codes/2598-smallest-missing-non-negative-integer-after-operations.cpp b/Codes/2598-smallest-missing-non-negative-integer-after-operations.cpp
@@ -2,24 +2,23 @@
  * @Author: LetMeFly
  * @Date: 2025-10-16 19:40:17
  * @LastEditors: LetMeFly.xyz
- * @LastEditTime: 2025-10-16 19:43:19
+ * @LastEditTime: 2025-10-16 20:23:38
  */
 #if defined(_WIN32) || defined(__APPLE__)
 #include "_[1,2]toVector.h"
 #endif
 
-// THIS IS NOT RIGHT
+// THIS IS RIGHT
 class Solution {
 public:
     int findSmallestInteger(vector<int>& nums, int value) {
         unordered_map<int, int> ma;
         for (int t : nums) {
-            ma[t % value]++;
+            ma[(t % value + value) % value]++;
         }
         int ans = 0;
         while (true) {
-            cout << ans << ',' << ma[ans] << endl;
-            if (--ma[ans] == -1) {
+            if (--ma[ans % value] == -1) {
                 return ans;
             }
             ans++;
diff --git a/Codes/2598-smallest-missing-non-negative-integer-after-operations_right.cpp b/Codes/2598-smallest-missing-non-negative-integer-after-operations_right.cpp
diff --git a/Codes/lib.rs b/Codes/lib.rs
@@ -5,4 +5,4 @@
  * @LastEditTime: 2025-10-11 18:47:55
  */
 pub struct Solution;
-include!("2598-smallest-missing-non-negative-integer-after-operations.rs");  // 这个fileName是会被脚本替换掉的
+include!("2011-final-value-of-variable-after-performing-operations_20251020.rs");  // 这个fileName是会被脚本替换掉的
diff --git a/Solutions/LeetCode 2011.执行操作后的变量值.md b/Solutions/LeetCode 2011.执行操作后的变量值.md
@@ -1,11 +1,11 @@
 ---
-title: 2011.执行操作后的变量值
+title: 2011.执行操作后的变量值：简单题简单做
 date: 2022-12-23 19:19:38
 tags: [题解, LeetCode, 简单, 数组, 字符串, 模拟]
 categories: [题解, LeetCode]
 ---
 
-# 【LetMeFly】2011.执行操作后的变量值
+# 【LetMeFly】2011.执行操作后的变量值：简单题简单做
 
 力扣题目链接：[https://leetcode.cn/problems/final-value-of-variable-after-performing-operations/](https://leetcode.cn/problems/final-value-of-variable-after-performing-operations/)
 
@@ -86,6 +86,9 @@ X--：X 减 1 ，X = 1 - 1 = 0
 #### C++
 
 ```cpp
+/*
+ *  @LastEditTime: 2022-12-23 19:18:09
+ */
 // 下面代码中，ans即为题解中的X。使用变量ans是一些ACMer的习惯
 class Solution {
 public:
@@ -102,5 +105,98 @@ public:
 };
 ```
 
+#### C++
+
+```cpp
+/*
+ * @LastEditTime: 2025-10-20 18:46:29
+ */
+class Solution {
+public:
+    int finalValueAfterOperations(vector<string>& operations) {
+        int ans = 0;
+        for (string& op : operations) {
+            ans += op[1] == '+' ? 1 : -1;
+        }
+        return ans;
+    }
+};
+```
+
+#### Go
+
+```go
+/*
+ * @LastEditTime: 2025-10-20 18:48:49
+ */
+package main
+
+func finalValueAfterOperations(operations []string) (ans int) {
+    for _, op := range operations {
+        if op[1] == '+' {
+            ans++;
+        } else {
+            ans--
+        }
+    }
+    return
+}
+```
+
+#### Java
+
+```java
+/*
+ * @LastEditTime: 2025-10-20 18:48:23
+ */
+class Solution {
+    public int finalValueAfterOperations(String[] operations) {
+        int ans = 0;
+        for (String op : operations) {
+            if (op.charAt(1) == '+') {
+                ans++;
+            } else {
+                ans--;
+            }
+        }
+        return ans;
+    }
+}
+```
+
+#### Python
+
+```python
+'''
+LastEditTime: 2025-10-20 18:47:35
+'''
+from typing import List
+
+class Solution:
+    def finalValueAfterOperations(self, operations: List[str]) -> int:
+        return sum(1 if op[1] == '+' else -1 for op in operations)
+```
+
+#### Rust
+
+```rust
+/*
+ * @LastEditTime: 2025-10-20 18:56:38
+ */
+impl Solution {
+    pub fn final_value_after_operations(operations: Vec<String>) -> i32 {
+        let mut ans: i32 = 0;
+        for op in operations {
+            if op.as_bytes()[1] == b'+' {
+                ans += 1;  // cannot write as: ans++;
+            } else {
+                ans -= 1;
+            }
+        }
+        ans
+    }
+}
+```
+
 > 同步发文于CSDN，原创不易，转载请附上[原文链接](https://blog.letmefly.xyz/2022/12/23/LeetCode%202011.%E6%89%A7%E8%A1%8C%E6%93%8D%E4%BD%9C%E5%90%8E%E7%9A%84%E5%8F%98%E9%87%8F%E5%80%BC/)哦~
 > Tisfy：[https://letmefly.blog.csdn.net/article/details/128423159](https://letmefly.blog.csdn.net/article/details/128423159)
diff --git a/Solutions/LeetCode 2598.执行操作后的最大MEX.md b/Solutions/LeetCode 2598.执行操作后的最大MEX.md
@@ -65,6 +65,19 @@ nums 的 MEX 是 2 。可以证明 2 是可以取到的最大 MEX 。
 
 遇到无可消耗的值即为答案MEX。
 
+### What's more
+
+负数取模：
+
+> python负数取模正数得到结果为正数，C++/Rust/Go/Java得到结果为负数。可以取模后加上模数再次取模保证结果落在$[0, 模数-1)$
+
+推荐题解：
+
+1. [黑魔法正则取模写法](https://leetcode.cn/problems/smallest-missing-non-negative-integer-after-operations/solutions/3807906/zheng-ze-biao-da-shi-jie-fa-by-stoic-kap-om09)
+2. [哈希表写法2](https://leetcode.cn/problems/smallest-missing-non-negative-integer-after-operations/solutions/2177789/tong-yu-pythonjavacgo-by-endlesscheng-qoan/)
+
+### 时空复杂度分析
+
 + 时间复杂度$O(len(nums))$
 + 空间复杂度$O(\min(len(nums), value))$
 
@@ -76,10 +89,6 @@ nums 的 MEX 是 2 。可以证明 2 是可以取到的最大 MEX 。
 /*
  * @LastEditTime: 2025-10-16 19:43:19
  */
-#if defined(_WIN32) || defined(__APPLE__)
-#include "_[1,2]toVector.h"
-#endif
-
 class Solution {
 public:
     int findSmallestInteger(vector<int>& nums, int value) {
diff --git a/Solutions/Other-English-LearningNotes-SomeWords.md b/Solutions/Other-English-LearningNotes-SomeWords.md
@@ -1526,6 +1526,19 @@ categories: [自用]
 |bullish|adj. (股票价格)看涨的，牛市的；自信的；积极乐观的|
 |||
 |hairpin|n. 发夹<br/>adj. U字形的|
+|||
+|quay|n. 码头|
+|nightgown|n. 女睡衣|
+|personnel|n. 人事部门，人员，职员|
+|jury|n. 陪审团，裁判委员会<br/>adj. (船上)应急用的|
+|||
+|pyjamas|n. (一套)睡衣裤|
+|tuna|n. 金枪鱼|
+|||
+|picturesque|adj. 优美的，古色古香的，生动的，栩栩如生的|
+|||
+|reproach|v. 责备，指责<br/>n. 责备，指责，令人感动羞愧的人|
+|quiver|v. 轻微颤动，发抖<br/>n. 哆嗦，箭袋|
 
 + 这个web要是能设计得可以闭眼(完全不睁眼)键盘控制背单词就好了。
 + 也许可以加个AI用最近词编故事功能(返回接口中支持标注所使用单词高亮?)
diff --git a/Solutions/Other-Japanese-LearningNotes.md b/Solutions/Other-Japanese-LearningNotes.md
@@ -944,7 +944,8 @@ xx型
 |選手(せんしゅ)|选手|
 |歌手(かしゅ)|歌手|
 |ボランティア(borantia)|志愿者|
-|スタッフ|工作人员|
+|スタッフ(staff)|工作人员|
+|クライアント(client)|客户|
 |受付(うけつけ)|前台/接待处|
 |||
 |左(ひだり)|左边|
diff --git a/toSay.md b/toSay.md
@@ -0,0 +1 @@
+今天扇贝单词大改版了(2025.10.16)
diff --git a/todo b/todo
