查找不允许重复的两个数组的交集

function findIntersection(arr1, arr2) {
  // 创建结果数组
  let intersection = [];

  // 遍历数组arr1
  for (let i = 0; i < arr1.length; i++) {
    let current = arr1[i];

    // 判断当前元素是否存在于arr2中
    if (arr2.includes(current)) {
      // 将当前元素添加到结果数组中
      intersection.push(current);

      // 从arr2中删除当前元素
      arr2.splice(arr2.indexOf(current), 1);
    }
  }

  return intersection;
}

// 示例用法
let array1 = [1, 2, 3, 4, 5];
let array2 = [4, 5, 6, 7, 8];
let result = findIntersection(array1, array2);
console.log(result); // 输出 [4, 5]