https://leetcode.com/problems/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.
1、sort排序后查找是否有相邻元素相等(40ms)
class Solution {
public:bool containsDuplicate(vector<int>& nums) {
sort(nums.begin(),nums.end());
int len = nums.size();
for(int i = 0;i<len-1;i++){
if(nums[i+1]==nums[i])
return true;
}
return false;
}
};
2、set,扫描一次(100ms)
class Solution {
public:
bool containsDuplicate(vector<int>& nums) {
int len = nums.size();
set<int> arr;
for(int i = 0;i<len;i++){
if(arr.find(nums[i])!=arr.end())
return true;
arr.insert(nums[i]);
}
return false;
}
};