[leetcode] 219. Contains Duplicate II
来源:互联网 发布:ie浏览器不能登陆淘宝 编辑:程序博客网 时间:2024/06/15 21:43
Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j]and the difference between i and j is at most k.
这道题是判断数组中是否有下标间距不超过k的相等元素,题目难度为Easy。
题目和第217题相关,大家可以先看下第217题(传送门)。重复元素的判断还依靠Hash Table,遍历数组,如果当前元素之前没有相同元素将其加入Hash Table;如果有相同元素,判断二者下标差,不超过k则返回true,超过k则更新该元素在Hash Table中记录的下标为当前下标,以便后续继续比较使用。具体代码:
class Solution {public: bool containsNearbyDuplicate(vector<int>& nums, int k) { unordered_map<int, int> hash; for(int i=0; i<nums.size(); ++i) { if((hash.find(nums[i]) != hash.end()) && (i - hash[nums[i]] <= k)) return true; else hash[nums[i]] = i; } return false; }};
0 0
- [leetcode] 219. Contains Duplicate II
- LeetCode 219. Contains Duplicate II
- LeetCode:219. Contains Duplicate II
- 【Leetcode】219. Contains Duplicate II
- Leetcode 219. Contains Duplicate II
- 219. Contains Duplicate II LeetCode
- 【LeetCode】219. Contains Duplicate II
- Leetcode 219. Contains Duplicate II
- LeetCode *** 219. Contains Duplicate II
- LeetCode 219. Contains Duplicate II
- LeetCode 219. Contains Duplicate II
- LeetCode 219. Contains Duplicate II
- leetcode 219. Contains Duplicate II
- 219.[Leetcode]Contains Duplicate II
- Leetcode 219. Contains Duplicate II
- 【leetcode】219. Contains Duplicate II
- LeetCode - 219. Contains Duplicate II
- leetcode 219. Contains Duplicate II
- GC的三种收集方法
- Mybatis最入门---映射文件(1)
- Python中 单引号,双引号和三引号的区别
- UITableView+UIHeadView上控件位置不动+UIImageView 下拉放大
- Java集合 问题集中
- [leetcode] 219. Contains Duplicate II
- shell 小符号的使用
- Mybatis最入门---映射文件(2)
- 一些CS相关的公开课资料
- android高级面试题目
- 常用正则表达式大全,手机、电话、邮箱、身份证(最严格的验证)、IP地址、网址、日期等,一般前台js验证,来这里就够了...
- Mybatis最入门---ResultMaps基本用法
- window内置对象和js内置对象与方法
- ionic入门教程第八课-(加更)从无到有说Ionic、画图说明MVC-U-S