update: 添加问题“961.在长度2N的数组中找出重复N次的元素”的代码和题解(1commit) (#1298)

961: AC.cpp (#1297)

方法一.1：排序+相邻
cpp - AC,100.00%,89.42%
py  - AC,30.97%,96.34%
go  - AC,36.00%,64.00%
java- AC,17.13%,5.06%
rust- AC,100.00%,28.57%

方法一.1：排序+中间
cpp - AC,27.01%,90.69%
py  - AC,24.09%,96.99%
go  - AC,8.00%,56.00%
java- AC,17.13%,5.06%
rust- AC,100.00%,28.57%

方法二：哈希表
cpp - AC,100.00%,89.23%
py  - AC,100.00%,96.34%
go  - AC,100.00%,84.00%
java- AC,78.65%,56.74%
rust- AC,100.00%,100.00%

方法三：相隔或相邻
cpp - AC,100.00%,99.63%
py  - AC,100.00%,99.14%
go  - AC,100.00%,44.00%
java- AC,100.00%,41.01%
rust-AC,100.00%,42.86%

方法四：变种摩尔投票法
cpp - AC,100.00%,99.63%
py  - AC,38.92%,72.90%
go  - AC,100.00%,48.00%
java- AC,44.94%,12.08%
rust- AC,100.00%,100.00%

方法五：随机数
cpp - AC,100.00%,92.15%
py  - AC,50.54%,99.78%
go  - AC,100.00%,56.00%
java- AC,78.65%,40.45%
rust- AC,100.00%,28.57%

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

Author: LetMeFly666

.commitTitleExtra

@@ -0,0 +1 @@
+(1commit)

.commitmsg

@@ -0,0 +1,43 @@
+961: AC.cpp (#1297)
+
+方法一.1：排序+相邻
+cpp - AC,100.00%,89.42%
+py  - AC,30.97%,96.34%
+go  - AC,36.00%,64.00%
+java- AC,17.13%,5.06%
+rust- AC,100.00%,28.57%
+
+方法一.1：排序+中间
+cpp - AC,27.01%,90.69%
+py  - AC,24.09%,96.99%
+go  - AC,8.00%,56.00%
+java- AC,17.13%,5.06%
+rust- AC,100.00%,28.57%
+
+方法二：哈希表
+cpp - AC,100.00%,89.23%
+py  - AC,100.00%,96.34%
+go  - AC,100.00%,84.00%
+java- AC,78.65%,56.74%
+rust- AC,100.00%,100.00%
+
+方法三：相隔或相邻
+cpp - AC,100.00%,99.63%
+py  - AC,100.00%,99.14%
+go  - AC,100.00%,44.00%
+java- AC,100.00%,41.01%
+rust-AC,100.00%,42.86%
+
+方法四：变种摩尔投票法
+cpp - AC,100.00%,99.63%
+py  - AC,38.92%,72.90%
+go  - AC,100.00%,48.00%
+java- AC,44.94%,12.08%
+rust- AC,100.00%,100.00%
+
+方法五：随机数
+cpp - AC,100.00%,92.15%
+py  - AC,50.54%,99.78%
+go  - AC,100.00%,56.00%
+java- AC,78.65%,40.45%
+rust- AC,100.00%,28.57%

.github/workflows/1problem1day-label.yml

@@ -175,12 +175,14 @@ jobs:
       
       - name: Generate GitHub App token
         id: app-token
+        if: steps.update-status.outputs.skip != 'true'
         uses: actions/create-github-app-token@v1
         with:
           app-id: ${{ vars.DAILY_BOT_APP_ID }}
           private-key: ${{ secrets.DAILY_BOT_APP_PRIVATE_KEY }}
 
       - name: Comment on issue
+        if: steps.update-status.outputs.skip != 'true'
         uses: actions/github-script@v7
         with:
           github-token: ${{ steps.app-token.outputs.token }}

Codes/0961-n-repeated-element-in-size-2n-array_20260102-1.1-sort+near.cpp

@@ -0,0 +1,22 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-01-02 12:47:42
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-01-02 13:05:32
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    int repeatedNTimes(vector<int>& nums) {
+        sort(nums.begin(), nums.end());
+        for (int i = 1; i < nums.size(); i++) {
+            if (nums[i] == nums[i - 1]) {
+                return nums[i];
+            }
+        }
+        return -1;  // FAKE RETURN
+    }
+};

Codes/0961-n-repeated-element-in-size-2n-array_20260102-1.1-sort+near.go

@@ -0,0 +1,19 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-01-02 12:47:42
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-01-02 17:23:19
+ */
+package main
+
+import "sort"
+
+func repeatedNTimes(nums []int) int {
+    sort.Ints(nums)
+    for i := 1; i < len(nums); i++ {
+        if nums[i] == nums[i - 1] {
+            return nums[i]
+        }
+    }
+    return -1  // FAKE RETURN
+}

Codes/0961-n-repeated-element-in-size-2n-array_20260102-1.1-sort+near.java

@@ -0,0 +1,19 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-01-02 12:47:42
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-01-02 17:41:05
+ */
+import java.util.Arrays;
+
+class Solution {
+    public int repeatedNTimes(int[] nums) {
+        Arrays.sort(nums);
+        for (int i = 1; i < nums.length; i++) {
+            if (nums[i] == nums[i-1]) {
+                return nums[i];
+            }
+        }
+        return -1;
+    }
+}

Codes/0961-n-repeated-element-in-size-2n-array_20260102-1.1-sort+near.py

@@ -0,0 +1,14 @@
+'''
+Author: LetMeFly
+Date: 2026-01-02 12:47:42
+LastEditors: LetMeFly.xyz
+LastEditTime: 2026-01-02 14:48:48
+'''
+from typing import List
+
+class Solution:
+    def repeatedNTimes(self, nums: List[int]) -> int:
+        nums.sort()
+        for i in range(1, len(nums)):
+            if nums[i] == nums[i - 1]:
+                return nums[i]

Codes/0961-n-repeated-element-in-size-2n-array_20260102-1.1-sort+near.rs

@@ -0,0 +1,17 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-01-02 12:47:42
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-01-02 17:58:03
+ */
+impl Solution {
+    pub fn repeated_n_times(mut nums: Vec<i32>) -> i32 {
+        nums.sort();
+        for i in 1..nums.len() {
+            if nums[i] == nums[i - 1] {
+                return nums[i];
+            }
+        }
+        -1  // FAKE RETURN
+    }
+}

Codes/0961-n-repeated-element-in-size-2n-array_20260102-1.2-sort+half.go

@@ -0,0 +1,18 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-01-02 17:24:39
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-01-02 17:24:44
+ */
+package main
+
+import "sort"
+
+func repeatedNTimes(nums []int) int {
+    sort.Ints(nums)
+    mid := len(nums) / 2
+    if nums[mid] == nums[mid + 1] {
+        return nums[mid]
+    }
+    return nums[mid - 1]
+}

Codes/0961-n-repeated-element-in-size-2n-array_20260102-1.2-sort+half.java

@@ -0,0 +1,15 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-01-02 17:43:17
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-01-02 17:43:23
+ */
+import java.util.Arrays;
+
+class Solution {
+    public int repeatedNTimes(int[] nums) {
+        Arrays.sort(nums);
+        int mid = nums.length / 2;
+        return nums[mid] == nums[mid + 1] ? nums[mid] : nums[mid - 1];
+    }
+}