-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcontains_duplicate.py
More file actions
47 lines (32 loc) · 976 Bytes
/
contains_duplicate.py
File metadata and controls
47 lines (32 loc) · 976 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
"""
217. Contains Duplicate
Difficulty:Easy
Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct.
Example 1:
Input: nums = [1,2,3,1]
Output: true
Example 2:
Input: nums = [1,2,3,4]
Output: false
Example 3:
Input: nums = [1,1,1,3,3,4,3,2,4,2]
Output: true
Constraints:
1 <= nums.length <= 105
-109 <= nums[i] <= 109
"""
from typing import List
class Solution:
def containsDuplicate(self, nums: List[int]) -> bool:
hash_table = {}
for n in nums:
if n not in hash_table:
hash_table[n] = True
else:
return True
return False
if __name__ == "__main__":
solution = Solution()
# print(solution.containsDuplicate(nums=[1, 2, 3, 1])) # true
print(solution.containsDuplicate(nums=[1, 2, 3, 4])) # false
# print(solution.containsDuplicate(nums=[1, 1, 1, 3, 3, 4, 3, 2, 4, 2])) # true