[LeedCode OJ]#217 Contains Duplicate
2015-08-24 15:27
465 查看
【 声明:版权所有,转载请标明出处,请勿用于商业用途。 联系信箱:libin493073668@sina.com】
题目链接:https://leetcode.com/problems/contains-duplicate/
题意:
判断一个数组是否含有相同的元素
思路:
哈希统计数字是否被访问过
题目链接:https://leetcode.com/problems/contains-duplicate/
题意:
判断一个数组是否含有相同的元素
思路:
哈希统计数字是否被访问过
class Solution { public: bool containsDuplicate(vector<int>& nums) { int i,len = nums.size(); map<int,int> vis; for(i = 0; i<len; i++) { if(vis[nums[i]]) return true; vis[nums[i]] = 1; } return false; } };
相关文章推荐
- ORA-15081: failed to submit an I/O operation to a disk
- [LeedCode OJ]#172 Factorial Trailing Zeroes
- Codeforces Round #317 [AimFund Thanks-Round] (Div. 2) C(组合数+容斥)
- ubuntu编译airplay
- [LeedCode OJ]#70 Climbing Stairs
- svn cleanup failed–previous operation has not finished; run cleanup if it was interrupted
- contains选择器
- WebLogic11g-半小时让你的domain集群化
- hdu5009 Paint Pearls(离散+线性dp)
- 木马常用AIP函数
- HDU 1039.Easier Done Than Said?【字符串处理】【8月24】
- ORA-09925: Unable to create audit trail file
- POJ 1995 Raising Modulo Numbers(快速幂,同余定理)
- 模型选择准则之AIC和BIC
- Raising Modulo Numbers(poj 1995 快速幂)
- Raising Modulo Numbers(poj 1995 快速幂)
- assign、retain、copy使用异同
- POJ--1995--Raising Modulo Numbers
- Raising Modulo Numbers
- quartz 关联多个JobDetail和SimpleTrigger多任务调度