題目
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.
題目大意
給定整數(shù)數(shù)組，查找數(shù)組是否包含任何重復(fù)項(xiàng)凝赛。如果數(shù)組中的任何值至少出現(xiàn)兩次注暗，則函數(shù)應(yīng)返回true，如果每個(gè)元素都不同墓猎，則返回false
解題思路
查找一個(gè)數(shù)是否出現(xiàn)兩次捆昏，則判斷是否會落盡同一個(gè)坑中即可
class Solution {
public:
bool containsDuplicate(vector<int>& nums) {
map<int, int> searchMap;
for(int i=0; i < nums.size(); ++i)
{
map<int, int>::iterator l_it = searchMap.find(nums[i]);
if(l_it == searchMap.end())
{
searchMap[nums[i]]=nums[i];
}
else
{
return true;
}
}
return false;
}
};
