leetcode 219. Contains Duplicate II
来源:互联网 发布:淘宝网首页免费注册 编辑:程序博客网 时间:2024/05/12 09:31
题意:在整数数组里面找到两个相等的数,并且下标的差不大于k,如果存在就返回true,否则返回false
解题思路:
依然是HashMap的应用
代码
public class Solution { public boolean containsNearbyDuplicate(int[] nums, int k) { Map<Integer , Integer> map = new HashMap<Integer , Integer>(); int len = nums.length; for(int i=0; i<len; i++){ if(map.containsKey(nums[i]) && (i-map.get(nums[i]))<=k){ return true; } map.put(nums[i],i); } return false; }}
0 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
- MVC、MVP的理解
- centos 安装mysql,启动时报错Starting MySQL.Manager of pid-file quit without updating file.[FAILED]
- 深入浅出 RPC - 深入篇
- Lua 中实现面向对象
- 团体程序设计天梯赛-练习集 L2-006. 树的遍历
- leetcode 219. Contains Duplicate II
- I/O空间-----I/O端口和I/O内存
- Linux下几种文件传输命令 sz rz sftp scp
- The Triangle
- 阅读代码利器
- 树
- 一天一条Linux指令-umount
- Java学习笔记(十九):关于Random.nextInt()
- php 简单分页类