-
Notifications
You must be signed in to change notification settings - Fork 44
/
Copy pathcontains-duplicate.py
58 lines (49 loc) · 1.37 KB
/
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
"""
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
"""
# Time: O(n)
# Space: O(n)
#
# 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.
#
# V0
# V1
class Solution(object):
def containsDuplicate(self, nums):
if len(set(nums)) != len(nums):
return True
else:
return False
# V1'
# https://www.jiuzhang.com/solution/contains-duplicate/#tag-highlight-lang-python
class Solution:
"""
@param nums: the given array
@return: if any value appears at least twice in the array
"""
def containsDuplicate(self, nums):
# Write your code here
hashset = {}
for num in nums:
if num in hashset:
return True
hashset[num] = True
return False
# V2
class Solution:
# @param {integer[]} nums
# @return {boolean}
def containsDuplicate(self, nums):
return len(nums) > len(set(nums))