Leetcode_219 Contains Duplicate II

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 i and j is at most k.

查找nums[i] = nums[j]的元素并且下标差值 i-j<=k, 依然可以用map来实现，元素值作为key，下标作为value

public class Solution {
    public boolean containsNearbyDuplicate(int[] nums, int k) {
         Map<Integer, Integer> map = new HashMap<Integer, Integer>();
         for (int i = 0; i < nums.length; i++) {
            if (map.containsKey(nums[i]) && (i-map.get(nums[i]))<=k) {
                return true;
            }
            map.put(nums[i], i);
        }
            return false;
        }
}