219. Contains Duplicate II（存在重复元素 II）

题目链接：https://leetcode.com/problems/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

方法一：

用set，滑动窗口：

Runtime: 7 ms, faster than 90.80% of Java online submissions for Contains Duplicate II.

Memory Usage: 42.3 MB, less than 91.66% of Java online submissions for Contains Duplicate II.

class Solution {
    public boolean containsNearbyDuplicate(int[] nums, int k) {
        if(nums==null||nums.length==0)
            return false;
        Set<Integer> set=new HashSet();
        for(int i=0;i<nums.length;i++){
            if(i>k)
                set.remove(nums[i-k-1]);
            if(!set.add(nums[i]))
                return true;
        }
        return false;
    }
}

方法二：

我发现有一个最快的答案竟然是错的，但还是能AC通过，公开处刑：

class Solution {
    public boolean containsNearbyDuplicate(int[] nums, int k) {
        //Map<Integer, Integer> map = new HashMap<>();
        //Key: Index, Val: val
        if(nums.length == 0 || nums.length == 1)
            return false;
        for(int i = 0; i < nums.length; i++){
            for(int j = i - 1; j >= 0; j--){
                if(nums[i] > nums[j]) break;
                else if(nums[i] == nums[j] && i - j <= k) return true;
            }
        }
        return false;
    }
}

能够证明他逻辑错误的用例很多，比如 [1,4,3,4,5]

当 i=3时，j=2,此时满足nums[i]>