leetcode961. N-Repeated Element in Size 2N Array
Posted seyjs
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了leetcode961. N-Repeated Element in Size 2N Array相关的知识,希望对你有一定的参考价值。
题目如下:
In a array
A
of size2N
, there areN+1
unique elements, and exactly one of these elements is repeated N times.Return the element repeated
N
times.
Example 1:
Input: [1,2,3,3] Output: 3
Example 2:
Input: [2,1,2,5,3,2] Output: 2
Example 3:
Input: [5,1,5,2,5,3,5,4] Output: 5
Note:
4 <= A.length <= 10000
0 <= A[i] < 10000
A.length
is even
解题思路:送分题。因为题目没有要求不能用额外的内存,所以我的方法是用字典保存每个数字出现的次数,从而找到出现N的数字。
代码如下:
class Solution(object): def repeatedNTimes(self, A): """ :type A: List[int] :rtype: int """ dic = {} res = 0 for i in A: dic[i] = dic.setdefault(i,0) + 1 if dic[i] == len(A)/2: res = i break return res
以上是关于leetcode961. N-Repeated Element in Size 2N Array的主要内容,如果未能解决你的问题,请参考以下文章
Leetcode 961. N-Repeated Element in Size 2N Array
[Leetcode]961. N-Repeated Element in Size 2N Array
leetcode961. N-Repeated Element in Size 2N Array
LeetCode --- 961. N-Repeated Element in Size 2N Array 结题报告