Contains Duplicate II
来源:互联网 发布:怎么查看电脑ip端口 编辑:程序博客网 时间:2024/06/10 21:38
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.
题目大意是:在一个数组中是否存在nums[i]==nums[j](假设i<j),且j-i<=k
思路和以前有个题目类似,借助HashMap来保存nums[i]和i,这样后面判断是否重复出现的只需查找map即可。如果重复出现,那就查键对应的值之差是否小于等于k
代码如下:
public class Solution { public boolean containsNearbyDuplicate(int[] nums, int k) { HashMap<Integer,Integer> map = new HashMap<Integer,Integer>(); for(int i=0;i<nums.length;i++){ if(map.containsKey(nums[i])){ int j = map.get(nums[i]); if(i-j<=k){ return true; }else{ //i-j>k //移除之前的,接着执行13行代码,把第二次重复出现的数的位置保存map中 //作为新的键值对 map.remove(nums[i]); } } map.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
- 个人Sublime Text 3使用的插件和配置
- start_kernel----lcokdep_init
- Struts2.3动态调用报 No result defined for action 错误
- GreenDAO数据库版本升级
- Cookie的用法
- Contains Duplicate II
- SEAndroid架构
- HTTP、TCP/IP、socket及bluetooth-socket的整理
- 在storyboard里设置VC的 tab bar item 的 selected image 运行tabbar不显示
- 使用c3p0与DBCP连接池,造成的MySql 8小时问题解决方案
- iOS控件UITextView 实现placeholder效果和解决UITableView键盘遮挡
- 在Linux上,编写一个每秒接收100万UDP数据包的程序究竟有多难
- hdu 1443
- [caffe]深度学习之图像分类模型VGG解读