leetCode 217. Contains Duplicate 数组
217. 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.
题目大意:
在数组中找到任意字符出现次数大于等于2次就返回true,如果数组中每一个字符都出现1次,则返回false。
代码如下:
classSolution{public:boolcontainsDuplicate(vector<int>&nums){unordered_map<int,int>myMap;for(inti=0;i<nums.size();i++){if(myMap.find(nums[i])==myMap.end()){myMap.insert(pair<int,int>(nums[i],1));}elsereturntrue;}returnfalse;}};
2016-08-12 01:36:29
声明:本站所有文章资源内容,如无特殊说明或标注,均为采集网络资源。如若本站内容侵犯了原著者的合法权益,可联系本站删除。