【LeetCode】217. Contains Duplicate
2015-08-20 11:06
375 查看
题目:
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.提示:
有两种思路:对输入的数组进行排序,然后比较相邻元素的值是否一致 - O(nlgn);
利用Hash Set - O(n)。
代码:
排序方法:class Solution { public: bool containsDuplicate(vector<int>& nums) { sort(nums.begin(), nums.end()); return unique(nums.begin(), nums.end()) != nums.end(); } };
利用Hash Set:
class Solution { public: bool containsDuplicate(vector<int>& nums) { unordered_set<int> unset; for (int i = 0; i < nums.size(); ++i) { if (unset.find(nums[i]) != unset.end()) return true; else unset.insert(nums[i]); } return false; } };
相关文章推荐
- UVa 514 Rails(经典栈)
- Saltstack系列:Saltstack的Grains和Pillar
- iostat和iowait详细解说(转载:http://oplinux.com/order/iostat.html)
- STL的pair
- close_wait状态的产生原因及解决
- MFC查看AfxWinMain VS2010命令行参数传入方法
- AfxGetMainWnd()为什么返回NULL
- hdu 5396 Expression 区间DP+排列组合 2015 Multi-University Training Contest 9
- [LightOJ1282]Leading and Trailing
- 2015 Multi-University Training Contest 9 1005
- uva 11177 - Fighting Against a Polygonal Monster(几何)
- HDOJ 1789 Doing Homework again (贪心&&优先队列)
- HDOJ 2674 N!Again (同余定理)
- POJ3250--Bad Hair Day(栈)
- CF#310 div2 D set+pair+贪心
- Chain of Responsibility模式
- LeetCode(70) Climbing Stairs
- poj1575 Easier Done Than Said?(模拟,水题)
- LeetCode(70) Climbing Stairs
- hdu 5319 Painter 2015 Multi-University Training Contest 3