leetcode Contains Duplicate II 哈希表
来源:互联网 发布:枪林弹雨免费刷枪软件 编辑:程序博客网 时间:2024/04/30 10:42
Given an array of integers and an integer k, find out whether there there are two distinct indices i and j in the array such that nums[i] = nums[j] and the difference between iand j is at most k.
Array Hash Table110道了,O(∩_∩)O,题目意思是给一个数组,判断数组中是否有序号差小于k且相等的两个数。
一开始用两个for循环,去查找,结果超时。看提示才知道用哈希表。
class Solution {public:bool containsNearbyDuplicate(vector<int>& nums, int k) {if (!nums.size()) return false;map<int, int> HashMap;for (int i = 0; i < nums.size(); i++){if (HashMap.find(nums[i]) != HashMap.end() && i - HashMap[nums[i]]<=k){return true;}HashMap[nums[i]] = i;}return false;}};
0 0
- leetcode Contains Duplicate II 哈希表
- [LeetCode]Contains Duplicate II
- [LeetCode] Contains Duplicate II
- leetcode Contains Duplicate II
- LeetCode Contains Duplicate II
- [leetcode] Contains Duplicate II
- LeetCode Contains Duplicate II
- 【leetcode】Contains Duplicate II
- leetcode--Contains Duplicate II
- [leetcode]Contains Duplicate II
- [leetCode] Contains Duplicate II
- LeetCode: Contains Duplicate II
- LeetCode Contains Duplicate II
- LeetCode | Contains Duplicate II
- LeetCode Contains Duplicate II
- 【LeetCode】Contains Duplicate II
- leetcode: Contains Duplicate II
- LeetCode Contains Duplicate II
- Leetcode-Word Break II
- Java获取项目路径下的方法(全)
- leetcode-223 Rectangle Area
- 安装程序无法创建 DCOM 用户帐户以注册 \valec.exe
- 【iOS开发系列】版本新特性界面
- leetcode Contains Duplicate II 哈希表
- 均匀设计表的构造+考虑子目标偏好度的均匀设计
- ViewPager滑动和点击切换内容
- 二分查找求解equal_range区间
- python爬虫示例(1)---urlretrieve() 函数使用
- 2012年5月SAT香港真题解析
- GRE写作必备句型
- SQL Server 2012数据库附加分离
- struts2中使用ajax和action读写数据的区别