leetcode 217: Contains Duplicate
2015-08-28 16:10
411 查看
class Solution { public: bool containsDuplicate(vector<int>& nums) { unordered_set<int> set; int n=nums.size(); for(int i=0;i<n;i++) { if(set.find(nums[i])!=set.end()) return true; set.insert(nums[i]); } return false; } };
相关文章推荐
- AIDLservice
- hdu5319 Painter
- 8.8.2 EXPLAIN Output Format
- ibaits的一个简单的完整的例子
- solr搭建企业级应用搜索(转自http://blog.csdn.net/zdshare/article/details/17756121)
- waiting for device
- The Responder Chain(响应链)
- * daemon not running. starting it now * ADB server didn't ACK * failed to start daemon *
- Go 语言sync中waitgroup使用.小实例
- Python_使用smtplib和email模块发送邮件
- OpenStack Mnaila 2015-08-27 IRC会议内容
- POJ3411--Paid Roads
- HDU 3376--Matrix Again【最大费用最大流 && 经典建图】
- notifier chain — 内核通知链
- Airbnb入华,或重蹈Uber覆辙?
- RAID5和RAID10,哪种RAID更适合你(下)
- RAID5和RAID10,哪种RAID更适合你(上)
- hadoop1 & hadoop2 fair-schduler 配置和使用
- hadoop1 & hadoop2 fair-schduler 配置和使用
- LeetCode题解:Container With Most Water