-
Notifications
You must be signed in to change notification settings - Fork 0
/
contains_duplicate.cpp
44 lines (35 loc) · 868 Bytes
/
contains_duplicate.cpp
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
/*
217. Contains Duplicate
Easy
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 {
public:
bool containsDuplicate(vector<int>& nums) {
unordered_map<int, int> m;
for(int i=0;i<nums.size();i++)
m[nums[i]]++;
unordered_map<int, int>::iterator it;
for(int i=0;i<nums.size();i++)
{
if(m[nums[i]]>=2)
return true;
}
for(int i=0;i<nums.size();i++)
{
if(m[nums[i]]>1)
return false;
}
return false;
}
};