leetcode-javascript/contains-duplicate-ii.js at master · didi0613/leetcode-javascript · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
/**
 * @param {number[]} nums
 * @param {number} k
 * @return {boolean}
 */
// Solution 1
var containsNearbyDuplicate = function (nums, k) {
    var len = nums.length;

    for (var i = 0; i < len - 1; i++) {
        for (var j = len - 1; j > i; j--) {
            if (nums[i] === nums[j] && (j - i) <= k) {
                return true;
            }
        }
    }

    return false;
};

// Solution 2
/**
 * @param {number[]} nums
 * @param {number} k
 * @return {boolean}
 */
var containsNearbyDuplicate = function (nums, k) {
    var hash = [];
    var len = nums.length;
    if (len <= 1) {
        return false;
    }

    // Hash
    // value => index
    for (var i in nums) {
        if (hash[nums[i]]) {
            if (Math.abs(hash[nums[i]] - i) <= k) {
                return true;
            }
        }
        hash[nums[i]] = i;
    }

    return false;
};