# 961.N Repeated Element in Size 2N Array

**961.N Repeated Element in Size 2N Array**

难度:Easy

> 在大小为 2N 的数组 A 中有 N+1 个不同的元素，其中有一个元素重复了 N 次。 返回重复了 N 次的那个元素。

```
示例 1：
输入：[1,2,3,3]
输出：3
示例 2：
输入：[2,1,2,5,3,2]
输出：2
示例 3：
输入：[5,1,5,2,5,3,5,4]
输出：5
提示：
4 <= A.length <= 10000
0 <= A[i] < 10000
A.length 为偶数
```

代码如下:

```
class Solution {
public:
    int repeatedNTimes(vector<int>& A) {
        unordered_map<int,int>ss;
        int N=A.size()/2;
        for(auto a: A)
        {
            
            ss[a]++;
            if(ss[a]==N) return a;
            
        }
        return A[A.size()-1];
    }
};
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://dfine.gitbook.io/leetcode/961.n_repeated_element_in_size_2n_array.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.