update: 添加问题“3289.数字小镇中的捣蛋鬼”的代码和题解 (#1192)

3289: AC.cpp+py+go+java | CE.rust + AC.rust (#1191)

cpp - AC,29.70%,35.65%
py - AC,100.00%,81.54%
go - AC,100.00%,25.81%
java - AC,44.37%,5.30%
rust - 无语法检查 CE
rust - AC,100.00%,45.45%
cpp-O(1)空间 - AC,100.00%,74.75%

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

Author: LetMeFly666

.commitmsg

@@ -0,0 +1,9 @@
+3289: AC.cpp+py+go+java | CE.rust + AC.rust (#1191)
+
+cpp - AC,29.70%,35.65%
+py - AC,100.00%,81.54%
+go - AC,100.00%,25.81%
+java - AC,44.37%,5.30%
+rust - 无语法检查 CE
+rust - AC,100.00%,45.45%
+cpp-O(1)空间 - AC,100.00%,74.75%

Codes/3289-the-two-sneaky-numbers-of-digitville.cpp

@@ -0,0 +1,25 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-10-31 22:19:33
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-10-31 22:19:51
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    vector<int> getSneakyNumbers(vector<int>& nums) {
+        unordered_set<int> se;
+        vector<int> ans;
+        for (int t : nums) {
+            if (se.count(t)) {
+                ans.push_back(t);
+            } else {
+                se.insert(t);
+            }
+        }
+        return ans;
+    }
+};

Codes/3289-the-two-sneaky-numbers-of-digitville.go

@@ -0,0 +1,19 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-10-31 22:19:33
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-10-31 22:24:27
+ */
+package main
+
+func getSneakyNumbers(nums []int) (ans []int) {
+    se := map[int]struct{}{}
+    for _, t := range nums {
+        if _, ok := se[t]; ok {
+            ans = append(ans, t)
+        } else {
+            se[t] = struct{}{}
+        }
+    }
+    return
+}

Codes/3289-the-two-sneaky-numbers-of-digitville.java

@@ -0,0 +1,24 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-10-31 22:19:33
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-10-31 22:27:27
+ */
+import java.util.Set;
+import java.util.HashSet;
+
+class Solution {
+    public int[] getSneakyNumbers(int[] nums) {
+        int[] ans = new int[2];
+        int already = 0;
+        Set<Integer> se = new HashSet<>();
+        for (int t : nums) {
+            if (se.contains(t)) {
+                ans[already++] = t;
+            } else {
+                se.add(t);
+            }
+        }
+        return ans;
+    }
+}

Codes/3289-the-two-sneaky-numbers-of-digitville.py

@@ -0,0 +1,18 @@
+'''
+Author: LetMeFly
+Date: 2025-10-31 22:19:33
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-10-31 22:21:51
+'''
+from typing import List
+
+class Solution:
+    def getSneakyNumbers(self, nums: List[int]) -> List[int]:
+        se = set()
+        ans = []
+        for t in nums:
+            if t in se:
+                ans.append(t)
+            else:
+                se.add(t)
+        return ans

Codes/3289-the-two-sneaky-numbers-of-digitville.rs

@@ -0,0 +1,22 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-10-31 22:19:33
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-10-31 22:33:07
+ */
+use std::collections::HashSet;
+// THIS IS NOT RIGHT
+impl Solution {
+    pub fn get_sneaky_numbers(nums: Vec<i32>) -> Vec<i32> {
+        let mut se = HashSet::new();
+        let mut ans = Vec::with_capacity(2);
+        for &t in nums {
+            if se.contains(t) {
+                ans.push(*t);
+            } else {
+                se.inserst(t);
+            }
+        }
+        ans
+    }
+}

Codes/3289-the-two-sneaky-numbers-of-digitville_Right.rs

@@ -0,0 +1,22 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-10-31 22:33:13
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-10-31 22:39:35
+ */
+use std::collections::HashSet;
+
+impl Solution {
+    pub fn get_sneaky_numbers(nums: Vec<i32>) -> Vec<i32> {
+        let mut se = HashSet::new();
+        let mut ans = Vec::with_capacity(2);
+        for t in nums {
+            if se.contains(&t) {
+                ans.push(t);
+            } else {
+                se.insert(t);
+            }
+        }
+        ans
+    }
+}

Codes/3289-the-two-sneaky-numbers-of-digitville_WeiYunSuan_O1KongJian.cpp

@@ -0,0 +1,42 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-10-31 22:40:51
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-10-31 22:49:15
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    vector<int> getSneakyNumbers(vector<int>& nums) {
+        int xored = 0;
+        for (int t : nums) {
+            xored ^= t;
+        }
+        for (int i = 0; i < nums.size() - 2; i++) {
+            xored ^= i;
+        }
+        // now xored is x^y
+
+        int lowbit = xored & -xored;
+        int ans1 = 0, ans2 = 0;
+
+        for (int t : nums) {
+            if (t & lowbit) {
+                ans1 ^= t;
+            } else {
+                ans2 ^= t;
+            }
+        }
+        for (int i = 0; i < nums.size() - 2; i++) {
+            if (i & lowbit) {
+                ans1 ^= i;
+            } else {
+                ans2 ^= i;
+            }
+        }
+        return {ans1, ans2};
+    }
+};

Codes/lib.rs

@@ -5,4 +5,4 @@
  * @LastEditTime: 2025-10-30 22:44:18
  */
 pub struct Solution;
-include!("3346-maximum-frequency-of-an-element-after-performing-operations-i.rs");  // 这个fileName是会被脚本替换掉的
+include!("3289-the-two-sneaky-numbers-of-digitville.rs");  // 这个fileName是会被脚本替换掉的

README.md

@@ -1021,6 +1021,7 @@
 |3272.统计好整数的数目|困难|<a href="https://leetcode.cn/problems/find-the-count-of-good-integers/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/04/12/LeetCode%203272.%E7%BB%9F%E8%AE%A1%E5%A5%BD%E6%95%B4%E6%95%B0%E7%9A%84%E6%95%B0%E7%9B%AE/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/147163366" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-the-count-of-good-integers/solutions/3648738/letmefly-3272tong-ji-hao-zheng-shu-de-sh-pjy8/" target="_blank">LeetCode题解</a>|
 |3280.将日期转换为二进制表示|简单|<a href="https://leetcode.cn/problems/convert-date-to-binary/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/01/01/LeetCode%203280.%E5%B0%86%E6%97%A5%E6%9C%9F%E8%BD%AC%E6%8D%A2%E4%B8%BA%E4%BA%8C%E8%BF%9B%E5%88%B6%E8%A1%A8%E7%A4%BA/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/144870892" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/convert-date-to-binary/solutions/3036032/letmefly-3280jiang-ri-qi-zhuan-huan-wei-149mv/" target="_blank">LeetCode题解</a>|
 |3285.找到稳定山的下标|简单|<a href="https://leetcode.cn/problems/find-indices-of-stable-mountains/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/12/19/LeetCode%203285.%E6%89%BE%E5%88%B0%E7%A8%B3%E5%AE%9A%E5%B1%B1%E7%9A%84%E4%B8%8B%E6%A0%87/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/144596618" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-indices-of-stable-mountains/solutions/3025068/letmefly-3285zhao-dao-wen-ding-shan-de-x-u3wc/" target="_blank">LeetCode题解</a>|
+|3289.数字小镇中的捣蛋鬼|简单|<a href="https://leetcode.cn/problems/the-two-sneaky-numbers-of-digitville/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/10/31/LeetCode%203289.%E6%95%B0%E5%AD%97%E5%B0%8F%E9%95%87%E4%B8%AD%E7%9A%84%E6%8D%A3%E8%9B%8B%E9%AC%BC/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/154214125" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/the-two-sneaky-numbers-of-digitville/solutions/3820570/letmefly-3289shu-zi-xiao-zhen-zhong-de-d-oz9r/" target="_blank">LeetCode题解</a>|
 |3297.统计重新排列后包含另一个字符串的子字符串数目I|中等|<a href="https://leetcode.cn/problems/count-substrings-that-can-be-rearranged-to-contain-a-string-i/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/01/09/LeetCode%203297.%E7%BB%9F%E8%AE%A1%E9%87%8D%E6%96%B0%E6%8E%92%E5%88%97%E5%90%8E%E5%8C%85%E5%90%AB%E5%8F%A6%E4%B8%80%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%95%B0%E7%9B%AEI/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/145031494" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-substrings-that-can-be-rearranged-to-contain-a-string-i/solutions/3042787/letmefly-3297tong-ji-zhong-xin-pai-lie-h-8ele/" target="_blank">LeetCode题解</a>|
 |3305.元音辅音字符串计数I|中等|<a href="https://leetcode.cn/problems/count-of-substrings-containing-every-vowel-and-k-consonants-i/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/03/12/LeetCode%203305.%E5%85%83%E9%9F%B3%E8%BE%85%E9%9F%B3%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%AE%A1%E6%95%B0I/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/146197747" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-of-substrings-containing-every-vowel-and-k-consonants-i/solutions/3607571/letmefly-3305yuan-yin-fu-yin-zi-fu-chuan-ptkg/" target="_blank">LeetCode题解</a>|
 |3306.元音辅音字符串计数II|中等|<a href="https://leetcode.cn/problems/count-of-substrings-containing-every-vowel-and-k-consonants-ii/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/03/13/LeetCode%203306.%E5%85%83%E9%9F%B3%E8%BE%85%E9%9F%B3%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%AE%A1%E6%95%B0II/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/146228751" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-of-substrings-containing-every-vowel-and-k-consonants-ii/solutions/3609545/letmefly-3306yuan-yin-fu-yin-zi-fu-chuan-7y2q/" target="_blank">LeetCode题解</a>|