<reponame>cnyy7/LeetCode_EY<gh_stars>0
#
# @lc app=leetcode id=961 lang=python3
#
# [961] N-Repeated Element in Size 2N Array
#
# https://leetcode.com/problems/n-repeated-element-in-size-2n-array/description/
#
# algorithms
# Easy (73.25%)
# Total Accepted:    37.4K
# Total Submissions: 51.1K
# Testcase Example:  '[1,2,3,3]'
#
# In a array A of size 2N, there are N+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
#
#
#
#
#
#


class Solution:
    def repeatedNTimes(self, A: List[int]) -> int:
        sol = [False]*10000
        for t in A:
            if not sol[t]:
                sol[t] = True
            else:
                return t

#
# @lc app=leetcode id=961 lang=python3
#
# [961] N-Repeated Element in Size 2N Array
#
# https://leetcode.com/problems/n-repeated-element-in-size-2n-array/description/
#
# algorithms
# Easy (73.25%)
# Total Accepted:    37.4K
# Total Submissions: 51.1K
# Testcase Example:  '[1,2,3,3]'
#
# In a array A of size 2N, there are N+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
#
#
#
#
#
#


class Solution:
    def repeatedNTimes(self, A: List[int]) -> int:
        sol = [False]*10000
        for t in A:
            if not sol[t]:
                sol[t] = True
            else:
                return t
# # @lc app=leetcode id=961 lang=python3 # # [961] N-Repeated Element in Size 2N Array # # https://leetcode.com/problems/n-repeated-element-in-size-2n-array/description/ # # algorithms # Easy (73.25%) # Total Accepted:    37.4K # Total Submissions: 51.1K # Testcase Example:  '[1,2,3,3]' # # In a array A of size 2N, there are N+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 # # # # # #