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.
代码2：
class Solution {
public:
bool containsDuplicate(vector<int>& nums) {
set<int> s;
for(int i:nums){
if(s.count(i)){return true;}
else{s.insert(i);}
}
return false;
}
};
代码1：
class Solution {
public:
bool containsDuplicate(vector<int>& nums) {
return nums.size() > set<int>(nums.begin(), nums.end()).size();
}
};
