题目链接:https://leetcode.com/problems/contains-duplicate/
题面:
217. Contains Duplicate
Easy
405524FavoriteShare
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
题意:求集合是否重复。
解题:map/hash记录一下。
代码:
class Solution {
public:
bool containsDuplicate(vector<int>& nums) {
unordered_map <int,int> cnt;
for(int i=0;i<nums.size();i++){
cnt[nums[i]]++;
if(cnt[nums[i]]==2)return true;
}
return false;
}
};