Leetcode 219. Contains Duplicate II
来源:互联网 发布:websocket java 案例 编辑:程序博客网 时间:2024/05/18 00:29
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 absolute difference between i and j is at most k.
217的升级版,http://blog.csdn.net/accepthjp/article/details/65442908
要求判断是否存在重复的数之间的下标距离不超过k。
出现过的数和之前的下标求绝对值,超过K则放弃前面的下标,记录新下标。
class Solution {public: bool containsNearbyDuplicate(vector<int>& nums, int k) { unordered_map<int, int> mp; for(int i = 0; i < nums.size(); i++) { if(mp.find(nums[i]) == mp.end()) mp[nums[i]] = i; else if(abs(mp[nums[i]]-i) <= k) return true; else mp[nums[i]] = i; } return false; }};
1 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
- C++使用TinyXml2解析Xml
- CPP_Basic_Code_P4.1-PP4.13.10
- c++ IO操作
- bootstrap中jquery插件——Carousel轮播广告
- 二分查找的两种实现方式
- Leetcode 219. Contains Duplicate II
- CCCC-GPLT L1-035. 情人节 团体程序设计天梯赛
- Java笔记
- angularjs与requirejs整合实用技巧
- 关于Floyd算法三重循环顺序的问题
- 分数加减法
- 测试
- 【DRP】笔记之JavaScript内置对象
- leetcode 169 Majority Element