leetcode-217-Contains Duplicate
2015-06-21 03:07
281 查看
Contains Duplicate
Givenan 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次,则返回真;每个数均只出现一次,则返回假。
先排序,若有相邻的数相同,则放回真
class Solution { public: bool containsDuplicate(vector<int>& nums) { if(nums.size()==0) return false; sort(nums.begin(),nums.end()); vector<int>::iterator p; for(p=nums.begin()+1;p!=nums.end();p++){ if(*p==*(p-1)) return true; } return false; } };
哈希
数组的值存在map中,统计各数出现的次数
class Solution { public: bool containsDuplicate(vector<int>& nums) { map<int,int>hash; for(int i=0;i<nums.size();i++) hash[nums[i]]++; for(int i=0;i<nums.size();i++) if(hash[nums[i]]>=2) return true; return false; } };
相关文章推荐
- 小白的柳州麻将黑科技.Part1 = 你不知道的门清
- [POJ 1804] Brainman · 逆序对
- 【Leetcode】Contains Duplicate 1 and 2
- LeetCode之“散列表”:Contains Duplicate && Contains Duplicate II
- leetcode - Container With Most Water
- c++ 返回值为 类的对象 http://blog.csdn.net/zyearn/article/details/9709041
- hdu - 1151 Air Raid(有向无环图的最小路径覆盖)
- http://www.aichengxu.com/view/14872
- assign, retain, copy, weak, strong
- 问题:Bringing up interface eth0: Device eth0 does not seem to be present,delaying initialization. [FAILED]—— 找不到网卡。
- 10 responsibility chain
- 杭电1302 The Snail
- 杭电 ACM HDU Train Problem I
- LeetCode:Container With Most Water 算法题详解
- 1.MyBaits 3.2 简介
- 十大经典数据挖掘算法(9) 朴素贝叶斯分类器 Naive Bayes
- RAID0 RAID1 RAID3 RAID5 RAID6 RAID10 RAID50概念详解
- Exchange发送邮件后卡在草稿箱
- error: server certificate verification failed 解决方案
- Algorithms—42.Trapping Rain Water