高效查找item.x >n和item.y <n的数组项

function findItems(arr, n) {
  const result = [];
  for (let i = 0; i < arr.length; i++) {
    if (arr[i].x > n && arr[i].y < n) {
      result.push(arr[i]);
    }
  }
  return result;
}

// 示例数组
const items = [
  { x: 5, y: 3 },
  { x: 10, y: 8 },
  { x: 7, y: 2 },
  { x: 4, y: 1 }
];

const n = 6;
const result = findItems(items, n);
console.log(result); // 输出: [ { x: 10, y: 8 }, { x: 7, y: 2 } ]

function findItemsWithHash(arr, n) {
  const result = [];
  const hashTable = new Map();

  for (let i = 0; i < arr.length; i++) {
    if (arr[i].x > n && arr[i].y < n) {
      hashTable.set(i, arr[i]);
    }
  }

  for (const [key, value] of hashTable) {
    result.push(value);
  }

  return result;
}

const resultWithHash = findItemsWithHash(items, n);
console.log(resultWithHash); // 输出: [ { x: 10, y: 8 }, { x: 7, y: 2 } ]