假设我们有两个像这样的文字数组-
const arr1 = [2, 4, 5, 3, 7, 8, 9]; const arr2 = [1, 4, 5, 2, 3, 7, 6];
我们需要编写一个JavaScript函数,该函数接受两个这样的数组,并返回一个删除了所有重复项的新数组(应该只出现一次)。
为此的代码将是-
const arr1 = [2, 4, 5, 3, 7, 8, 9]; const arr2 = [1, 4, 5, 2, 3, 7, 6]; const mergeArrays = (first, second) => { const { length: l1 } = first; const { length: l2 } = second; const res = []; let temp = 0; for(let i = 0; i < l1+l2; i++){ if(i >= l1){ temp = i - l1; if(!res.includes(first[temp])){ res.push(first[temp]); }; }else{ temp = i; if(!res.includes(second[temp])){ res.push(second[temp]); }; }; }; return res; }; console.log(mergeArrays(arr1, arr2));
输出结果
控制台中的输出-
[ 1, 4, 5, 2, 3, 7, 6, 8, 9 ]