My JS algorithm climb pit trip – intersection of two arrays

Day 26: Problem 349, intersection of two arrays

Address: leetcode-cn.com/problems/in…

Find the same value in indexOf, and then delete the duplicate value.

var intersection = function(nums1, nums2) { let a = nums1.filter(val => nums2.indexOf(val) > -1).sort((a,b) => a-b); For (let I = 0; i < a.length - 1; I++) / / delete duplicates {the if (a = = [I] a [I + 1]) {a.s plice (I + 1, 1); i--; } } return a; };Copy the code