Contains Duplicate II
来源:互联网 发布:凤凰财经数据库 编辑:程序博客网 时间:2024/05/17 02:37
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.
思路:遍历数组,用一个HashMap才存储数组中每个数字所对应的下标,如果当前数字不曾在HashMap中出现过直接将当前数字以及其下标加入HashMap中,如果已经出现过,则取出HashMap相应数字的下标,如果下标之差小于等于k直接返回true,如果下标之差大于k,那么就要更新HashMap中与当前数字相同的数字的下标为当前下标啦。
public class Solution { public boolean containsNearbyDuplicate(int[] nums, int k) { HashMap<Integer,Integer> hs=new HashMap<Integer,Integer>(); for(int i=0;i<nums.length;i++) { if(!hs.containsKey(nums[i])) hs.put(nums[i],i); else { int j=hs.get(nums[i]); if(Math.abs(i-j)<=k) return true; else hs.put(nums[i],i); } } return false; }}
0 0
- Contains Duplicate && Contains Duplicate II
- [LeetCode]Contains Duplicate II
- Contains Duplicate II
- [LeetCode] Contains Duplicate II
- leetcode Contains Duplicate II
- LeetCode Contains Duplicate II
- [leetcode] Contains Duplicate II
- LeetCode Contains Duplicate II
- LeetCode219:Contains Duplicate II
- #219 Contains Duplicate II
- 219. Contains Duplicate II
- 【leetcode】Contains Duplicate II
- leetcode--Contains Duplicate II
- 219Contains Duplicate II
- Contains Duplicate II
- Contains Duplicate II
- Contains Duplicate II
- Leetcode_219 Contains Duplicate II
- jqueryUI的拖动说明
- 百度Android定位SDK实现获取当前经纬度及位置
- ListView多选操作模式详解CHOICE_MODE_MULTIPLE与CHOICE_MODE_MULTIPLE_MODAL
- SurfaceView和SurfaceHolder
- hdu 5238 Calculator(线段树+CRT)
- Contains Duplicate II
- spring注解实例1
- HEVC多核拆分
- Log4J入门教程(一) 入门例程
- Auto Layout 使用心得(五)—— 根据文字、图片自动计算 UITableViewCell 高度
- 进程间通信--------共享内存
- java中的File创建文件
- 天雷滚滚—window8.1的Telnet是默认关闭
- GRE必背写作模板