leetcode-javascript/intersection-of-two-arrays.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
47
48
/**
 * @param {number[]} nums1
 * @param {number[]} nums2
 * @return {number[]}
 */
//Solution 1
var intersection = function (nums1, nums2) {
    var ret = [];

    var len1 = nums1.length, len2 = nums2.length;

    if (len1 < len2) {
        return intersection(nums2, nums1);
    }

    for (var i = 0; i < len2; i++) {
        if (nums1.includes(nums2[i]) && !ret.includes(nums2[i])) {
            ret.push(nums2[i]);
        }
    }

    return ret;
};

// Solution 2
/**
 * @param {number[]} nums1
 * @param {number[]} nums2
 * @return {number[]}
 */
var intersection = function (nums1, nums2) {
    var len1 = nums1.length;
    var len2 = nums2.length;

    if (len1 < len2) {
        return intersection(nums2, nums1);
    }

    //nums1 is larger than nums2
    var ret = [];
    for (var i = 0; i < len2; i++) {
        if (nums1.includes(nums2[i]) && !ret.includes(nums2[i])) {
            ret.push(nums2[i]);
        }
    }

    return ret;
};