g0201_0300.s0219_contains_duplicate_ii.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java17 Show documentation
Show all versions of leetcode-in-java17 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
package g0201_0300.s0219_contains_duplicate_ii;
// #Easy #Array #Hash_Table #Sliding_Window #2022_07_02_Time_15_ms_(99.09%)_Space_56_MB_(82.82%)
import java.util.HashMap;
import java.util.Map;
public class Solution {
public boolean containsNearbyDuplicate(int[] nums, int k) {
Map map = new HashMap<>();
int len = nums.length;
for (int i = 0; i < len; i++) {
Integer index = map.put(nums[i], i);
if (index != null && Math.abs(index - i) <= k) {
return true;
}
}
return false;
}
}