Leetcode-961. N-Repeated Element in Size 2N Array

最新推荐文章于 2023-02-25 22:41:55 发布

Muqianli

最新推荐文章于 2023-02-25 22:41:55 发布

阅读量166

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/Muqianli/article/details/88052510

版权

Leetcode 专栏收录该内容

17 篇文章 0 订阅

订阅专栏

—Easy

https://leetcode.com/problems/n-repeated-element-in-size-2n-array/

Code:

class Solution:
    def repeatedNTimes(self, A) -> int:
        list_number = []
        for elt in A:
            if elt not in list_number:
                list_number.append(elt)
            else:
                return elt

# s = Solution()
# print(s.repeatedNTimes([1,2,3,3]))
# print(s.repeatedNTimes([2,1,2,5,3,2]))
# print(s.repeatedNTimes([5,1,5,2,5,3,5,4]))

思路：

1.乍一看还以为是众数...