带公差的两个数组相交

function findIntersectWithTolerance(arr1, arr2, tolerance) {
  const map = new Map();
  const result = [];

  // 遍历第一个数组，记录元素出现次数
  for (let i = 0; i < arr1.length; i++) {
    const num = arr1[i];
    if (map.has(num)) {
      map.set(num, map.get(num) + 1);
    } else {
      map.set(num, 1);
    }
  }

  // 遍历第二个数组，检查相交元素
  for (let i = 0; i < arr2.length; i++) {
    const num = arr2[i];
    if (map.has(num)) {
      // 检查差值是否满足公差要求
      const diff = Math.abs(num - arr1[i]);
      if (diff <= tolerance) {
        result.push(num);
      }
    }
  }

  return result;
}

// 示例用法
const arr1 = [1, 2, 3, 4, 5];
const arr2 = [3, 4, 5, 6, 7];
const tolerance = 1;
const intersect = findIntersectWithTolerance(arr1, arr2, tolerance);
console.log(intersect); // 输出 [3, 4, 5]