LeetCode 219. 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 absolute difference between i and j is at most k.

Example 1:

Input: nums = [1,2,3,1], k = 3
Output: true

Example 2:

Input: nums = [1,0,1,1], k = 1
Output: true

Example 3:

Input: nums = [1,2,3,1,2,3], k = 2
Output: false

HashMap

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