-
Notifications
You must be signed in to change notification settings - Fork 0
/
217_contains_duplicate.py
61 lines (48 loc) · 1.35 KB
/
217_contains_duplicate.py
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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
'''
217. Contains Duplicate
Given an array of integers, find if the array contains any duplicates.
Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct.
Example 1:
Input: [1,2,3,1]
Output: true
Example 2:
Input: [1,2,3,4]
Output: false
Example 3:
Input: [1,1,1,3,3,4,3,2,4,2]
Output: true
'''
class Solution(object):
def containsDuplicate(self, nums):
'''
approach
hash table
make a dictionary and check if numbers are in dictionary
sorting
sort the items and compare the next numbers
set
compare the len of the original and the len of the set
'''
# hash table
dict = {}
for i in nums:
if i in dict:
return True
else:
dict[i] = i
# doesnt matter what the value is
return False
# # sorting
# if len(nums) < 2:
# return False
# nums.sort()
# for i in range(len(nums)-1):
# if nums[i] == nums[i+1]:
# return True
# return False
# # set
# return len(set(nums)) != len(nums)
if __name__ == '__main__':
# begin
s = Solution()
print(s.containsDuplicate([1, 2, 3, 4]))