LeetCode 219:Contains Duplicate II
来源:互联网 发布:2014年网络歌曲排行 编辑:程序博客网 时间:2024/06/17 06:47
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 jis at most k.
//给出一个整数数组,判断该数组内是否有两个元素值是相同的,且他们的索引值相差不大于k,是则返回true,否则返回false class Solution { public: bool containsNearbyDuplicate(vector<int>& nums, int k) { map<int, int> buf; int n = nums.size(); for (int i = 0; i < n; i++) { if (buf.find(nums[i]) != buf.end() && i - buf[nums[i]] <= k) { return true; } else { buf[nums[i]] = i; } } return false; } };
1 0
- leetcode 219: Contains Duplicate II
- LeetCode 219:Contains Duplicate II
- Contains Duplicate II - LeetCode 219
- Leetcode[219]-Contains Duplicate II
- LeetCode 219 Contains Duplicate II
- Leetcode 219 Contains Duplicate II
- 【Leetcode】Contains Duplicate II #219
- 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
- [leetcode 219] Contains Duplicate II
- 【LEETCODE】219-Contains Duplicate II
- 【LeetCode】219Contains Duplicate II
- LeetCode 219 Contains Duplicate II
- android事件分发 入口(dispatchTouchEvent)
- 年关将至,老板,你拿什么留住人?
- Netty4学习笔记(8)-- Channel接口
- 网页抓取
- SQL高效去重语句
- LeetCode 219:Contains Duplicate II
- 重构的那些事儿
- Unity Shader 学习笔记(十) 滚动效果Shader实例
- apk反编译修改后重新打包
- 自定义控件(六)- 百分比圆形
- 又见嵌入式
- Android内存泄露自动检测神器LeakCanary
- 逻辑回归算法
- NSTimer简介