leetCode(28):Contains Duplicate II
来源:互联网 发布:java游戏大合集 编辑:程序博客网 时间:2024/05/17 03:44
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.
哈希表的使用
class Solution {public: bool containsNearbyDuplicate(vector<int>& nums, int k) { map<int,int> value; for(int i=0;i<nums.size();++i) { if(value.find(nums[i])!=value.end() && i-value[nums[i]]<=k) return true; value[nums[i]]=i; } return false; }};
0 0
- leetCode(28):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
- 大型商贸系统(进货管理)技术解析(九)返厂单处理
- Remove Duplicates from Sorted List
- VS2010配置opencv
- iOS 平板与 Android 平板的交互与动画
- 《Java课程实习》日志(周三)
- leetCode(28):Contains Duplicate II
- [动态规划]0-1背包问题
- c++简单实现多线程并测试volatile的作用
- Ios Swift学习之一基础知识
- Day15(上).多态强化
- QT程序exe文件修改图标
- C++字符串操作集合
- DataTable 導出Excel
- 空闲时的思考1(二维数组存储字符串和指针)