update: 添加问题“2598.执行操作后的最大MEX”的代码和题解 (#1176)

2598: AC.cpp+py+java+go+rust (#1175)

WA.cpp
AC.cpp - AC,9.76%,37.81%
AC.py - AC,48.78%,43.90%
AC.java - AC,9.30%,6.98%
AC.go - AC,50.00%,12.50%
AC.rust - AC,50.00%,12.50%

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

Author: LetMeFly666

.commitmsg

@@ -1,10 +1,8 @@
-3350: AC.cpp (#1173)
+2598: AC.cpp+py+java+go+rust (#1175)
 
-WA.cpp+py+go+java+rust
-AC.cpp - AC,5.12%,21.99%
-WA.cpp - 写法2
-AC.cpp - 写法2,AC,98.49%,48.80%
-AC.py - AC,32.38%,85.24%
-AC.go - AC,91.89%,54.05%
-AC.java - AC,36.99%,75.72%
-AC.rust - AC,100.00%,20.00%
+WA.cpp
+AC.cpp - AC,9.76%,37.81%
+AC.py - AC,48.78%,43.90%
+AC.java - AC,9.30%,6.98%
+AC.go - AC,50.00%,12.50%
+AC.rust - AC,50.00%,12.50%

Codes/2598-smallest-missing-non-negative-integer-after-operations.cpp

@@ -0,0 +1,28 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-10-16 19:40:17
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-10-16 19:43:19
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+// THIS IS NOT RIGHT
+class Solution {
+public:
+    int findSmallestInteger(vector<int>& nums, int value) {
+        unordered_map<int, int> ma;
+        for (int t : nums) {
+            ma[t % value]++;
+        }
+        int ans = 0;
+        while (true) {
+            cout << ans << ',' << ma[ans] << endl;
+            if (--ma[ans] == -1) {
+                return ans;
+            }
+            ans++;
+        }
+    }
+};

Codes/2598-smallest-missing-non-negative-integer-after-operations.go

@@ -0,0 +1,19 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-10-16 19:40:17
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-10-16 20:01:33
+ */
+package main
+
+func findSmallestInteger(nums []int, value int) (ans int) {
+    cnt := map[int]int{}
+    for _, t := range nums {
+        cnt[(t % value + value) % value]++
+    }
+    for cnt[ans % value] > 0 {
+        cnt[ans % value]--
+        ans++
+    }
+    return
+}

Codes/2598-smallest-missing-non-negative-integer-after-operations.java

@@ -0,0 +1,22 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-10-16 19:40:17
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-10-16 19:59:10
+ */
+import java.util.Map;
+import java.util.HashMap;
+
+class Solution {
+    public int findSmallestInteger(int[] nums, int value) {
+        Map<Integer, Integer> cnt = new HashMap<>();
+        for (int t : nums) {
+            cnt.merge((t % value + value) % value, 1, Integer::sum);
+        }
+        int ans = 0;
+        while (cnt.merge(ans % value, -1, Integer::sum) >= 0) {  // 记得是大于等于
+            ans++;
+        }
+        return ans;
+    }
+}

Codes/2598-smallest-missing-non-negative-integer-after-operations.py

@@ -0,0 +1,17 @@
+'''
+Author: LetMeFly
+Date: 2025-10-16 19:40:17
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-10-16 19:55:23
+'''
+from typing import List
+from collections import Counter
+
+class Solution:
+    def findSmallestInteger(self, nums: List[int], value: int) -> int:
+        cnt = Counter(x % value for x in nums)  # python负数模正数是正数
+        ans = 0
+        while cnt[ans % value]:
+            cnt[ans % value] -= 1
+            ans += 1
+        return ans

Codes/2598-smallest-missing-non-negative-integer-after-operations.rs

@@ -0,0 +1,32 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-10-16 19:40:17
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-10-16 20:18:30
+ */
+use std::collections::HashMap;
+
+// 这语言设计的真精妙
+impl Solution {
+    pub fn find_smallest_integer(nums: Vec<i32>, value: i32) -> i32 {
+        let mut cnt: HashMap<i32, i32> = HashMap::new();
+        for x in nums {
+            *cnt.entry((x % value + value) % value).or_insert(0) += 1;
+        }
+
+        for ans in 0.. {
+            // if matches!(cnt.get_mut(&(ans % value)), Some(v) if *v > 0) {
+            //     *v -= 1;  // 无法使用v报错
+            //     continue;
+            // }
+            if let Some(v) = cnt.get_mut(&(ans % value)) {
+                if *v > 0 {  // 记得是大于
+                    *v -= 1;
+                    continue;
+                }
+            }
+            return ans;
+        }
+        unreachable!()
+    }
+}

Codes/2598-smallest-missing-non-negative-integer-after-operations_right.cpp

@@ -0,0 +1,27 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-10-16 19:40:17
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-10-16 20:23:38
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+// 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 + value) % value]++;
+        }
+        int ans = 0;
+        while (true) {
+            if (--ma[ans % value] == -1) {
+                return ans;
+            }
+            ans++;
+        }
+    }
+};

Codes/3350-adjacent-increasing-subarrays-detection-ii.cpp

@@ -2,13 +2,12 @@
  * @Author: LetMeFly
  * @Date: 2025-10-15 22:07:17
  * @LastEditors: LetMeFly.xyz
- * @LastEditTime: 2025-10-15 22:12:42
+ * @LastEditTime: 2025-10-15 22:52:33
  */
 #if defined(_WIN32) || defined(__APPLE__)
 #include "_[1,2]toVector.h"
 #endif
 
-// THIS IS NOT RIGHT
 class Solution {
 public:
     int maxIncreasingSubarrays(vector<int>& nums) {
@@ -18,12 +17,13 @@ class Solution {
             if (t <= lastVal) {
                 ans = max(ans, min(lastCnt, nowCnt));
                 ans = max(ans, nowCnt / 2);
-                lastCnt = nowCnt, nowCnt = 0;
+                // printf("ans = %d, t = %d, lastCnt = %d, nowCnt = %d\n", ans, t, lastCnt, nowCnt);
+                lastCnt = nowCnt, nowCnt = 1;
             } else {
                 nowCnt++;
             }
             lastVal = t;
         }
-        return ans;
+        return max({ans, min(lastCnt, nowCnt), nowCnt / 2});
     }
-};
+};

Codes/3350-adjacent-increasing-subarrays-detection-ii_right.cpp

@@ -2,13 +2,12 @@
  * @Author: LetMeFly
  * @Date: 2025-10-15 22:07:17
  * @LastEditors: LetMeFly.xyz
- * @LastEditTime: 2025-10-15 22:20:31
+ * @LastEditTime: 2025-10-15 22:20:57
  */
 #if defined(_WIN32) || defined(__APPLE__)
 #include "_[1,2]toVector.h"
 #endif
 
-// THIS IS NOT RIGHT
 class Solution {
 public:
     int maxIncreasingSubarrays(vector<int>& nums) {
@@ -17,6 +16,7 @@ class Solution {
             nowCnt++;
             if (i == nums.size() - 1 || nums[i] >= nums[i + 1]) {  // 递增数组之尾
                 ans = max({ans, min(lastCnt, nowCnt), nowCnt / 2});
+                lastCnt = nowCnt, nowCnt = 0;
             }
         }
         return ans;