问题: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.
方法:用一个map,遍历数组,如果不在map中,就现在map里添加这个元素,如果能在map中找到这个值,就返回true。
代码:
class Solution {
public:
bool containsDuplicate(vector<int>& nums) {
unordered_map<int,int> map;
int l=nums.size();
for(int i=0;i<l;i++){
if(map.find(nums[i]) != map.end()){
return true;
}
else map[nums[i]]=i;
}
return false;
}
};