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.
最开始用find结果显示超时,后来先将数据进行排序,后来就通过了
class Solution {
public:
bool containsDuplicate(vector<int>& nums) {
if(nums.size()<2)
return false;
sort(nums.begin(),nums.end());
for(int i=1; i<nums.size(); i++)
{
if(nums[i] == nums[i-1])
return true;
}
/* for(int i=0; i<nums.size();i++)
{
if((find(nums.begin()+i+1,nums.begin()+nums.size(),nums[i])) != (nums.begin()+nums.size()))
return true;
} */
return false;
}
};