-
Notifications
You must be signed in to change notification settings - Fork 0
/
easyarrays_217_containsDuplicate.py
51 lines (41 loc) · 1.18 KB
/
easyarrays_217_containsDuplicate.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
"""
https://leetcode.com/problems/contains-duplicate/
leetcode
easy
arrays, hashset
input : an integer array nums
output: true if any value appears at least twice in the array,
and return false if every element is distinct
Brute Force
def containsDuplicate(nums: List[int]) -> bool:
for i in range(len(nums)):
for j in range(i + 1, len(nums)):
if nums[i] == nums[j]:
return True
return False
Time Complexity: O(n^2), Space Complexity: O(1)
Improved Solution: Sort
def containsDuplicate(nums: List[int]) -> bool:
nums.sort()
left, right = 0, 1
while right < len(nums):
if nums[left] == nums[right]:
return True
else:
left, right = right, right + 1
return False
Time Complexity: O(nlogn), Space Complexity: O(1)
Optimized Solution: Set or Hash Table
Time Complexity: O(n), Space Complexity: O(n)
"""
def containsDuplicate(nums):
memo = set()
for number in nums :
if number in memo :
return True
else:
memo.add(number)
return False
print(containsDuplicate([1,2,3,1]))
print(containsDuplicate([1,2,3,4]))
print(containsDuplicate([1,1,1,3,3,4,3,2,4,2]))