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:

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

Example 2:

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

Example 3:

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

class  {
    public boolean containsNearbyDuplicate(int[] nums, int k) {
        if (nums == null || nums.length == 0 || k == 0) {
            return false;
      }
        Map<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < nums.length; i++) {
         if (map.containsKey(nums[i])) {
             int value = map.get(nums[i]);
               if (i - value <= k) {
                    return true;  
             } 
           }  
          
         //如果不存在nums[i]的话，则直接增加
              map.put(nums[i], i);
     }
        return false;
    }
}

219. contains duplicate ii

近期文章

近期评论

标签

热门

文章归档

分类目录

功能