leetcode 217 Contains Duplicate C++
来源:互联网 发布:编程一般多少钱一个月 编辑:程序博客网 时间:2024/06/14 12:23
我原本想用计数排序来做,就是下面的样子;
class Solution {public: bool containsDuplicate(vector<int>& nums) { int a[999999] = {0}; for (int i = 0 ;i < nums.size(); i++){ a[nums[i]]++; if(a[nums[i]] == 2) return true; } return false; }};
但是使用stl,直接用set就可以了
class Solution {public: bool containsDuplicate(vector<int>& nums) { set<int> s; for (int i=0;i<nums.size();i++){ if(s.count(nums[i])) return true; s.insert(nums[i]); } return false; }};
0 0
- LeetCode Contains Duplicate C
- [C语言][LeetCode][217]Contains Duplicate
- Contains Duplicate - LeetCode 217
- LeetCode 217:Contains Duplicate
- leetcode 217: Contains Duplicate
- Leetcode[217]-Contains Duplicate
- 【leetcode】【217】Contains Duplicate
- LeetCode 217 Contains Duplicate
- leetcode-217-Contains Duplicate
- Leetcode 217 Contains Duplicate
- Leetcode 217 Contains Duplicate
- leetcode 217:Contains Duplicate
- LeetCode 217: Contains Duplicate
- LeetCode #217 Contains Duplicate
- leetCode #217 Contains Duplicate
- leetcode 217: Contains Duplicate
- Leetcode #217 Contains Duplicate
- [Leetcode]#217 Contains Duplicate
- 易语言打开关闭
- DuplicateHandle用法
- 括号序列
- 面向对象设计的几个基本原则
- LeetCode-268.Missing Number
- leetcode 217 Contains Duplicate C++
- Very Simple WPF Drag and Drop Sample without Win32 Calls
- 大数阶乘
- nyoj 745 蚂蚁的难题(二)
- 共同学习Java源代码--常用工具类--StringBuffer(四)
- 剑指offer:删除链表中重复的结点
- Java学习笔记之常用方法类(四)DecimalFormat类、Pattern与Match类
- ns2 的安装
- KMP算法的实现