Java solution, using HashMap


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

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.