首页 > 代码库 > LeetCode-Contains Duplicate II
LeetCode-Contains Duplicate II
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 j is at most k.
Solution:
public class Solution { public boolean containsNearbyDuplicate(int[] nums, int k) { if (nums.length<2) return false; HashSet<Integer> numSet = new HashSet<Integer>(); for (int i=0;i<nums.length;i++){ if (numSet.contains(nums[i])){ return true; } //add nums[i] into set numSet.add(nums[i]); // if full, then remove the left most one. if (numSet.size()>k) numSet.remove(nums[i-k]); } return false; }}
LeetCode-Contains Duplicate II
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。