Easy to understand Java code with HashMap


  • 0
    W
    public class Solution {
        public boolean containsNearbyDuplicate(int[] nums, int k) {
            if (nums == null || nums.length < 2) return false; 
            Map<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;
                map.put(nums[i], i);
            }
            return false;
        }
    }
    

Log in to reply
 

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