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.
解决思路:使用一个关键字可重复的multiset,遍历数组nums并到multiset中查找是否有相同的关键字,如果存在返回true,否则把关键字存入集合继续遍历直到结束。(Time:96 ms)
class Solution {
public:
bool containsDuplicate(vector<int>& nums) {
multiset<int> multi;
for(auto i=nums.begin(); i!=nums.end(); ++i)
{
if (multi.count(*i) == 0)
{
multi.insert(*i);
}
else
{
return true;
}
}
return false;
}
};