确定矩形是否完全被另一组矩形覆盖所需的算法

function isRectangleCover(rectangles) {
  let minX = Infinity;
  let minY = Infinity;
  let maxX = -Infinity;
  let maxY = -Infinity;
  let area = 0;

  for (const rectangle of rectangles) {
    const [x1, y1, x2, y2] = rectangle;
    minX = Math.min(minX, x1);
    minY = Math.min(minY, y1);
    maxX = Math.max(maxX, x2);
    maxY = Math.max(maxY, y2);
    area += (x2 - x1) * (y2 - y1);
  }

  const expectedArea = (maxX - minX) * (maxY - minY);
  if (area !== expectedArea) {
    return false;
  }

  const corners = new Set();
  for (const rectangle of rectangles) {
    const [x1, y1, x2, y2] = rectangle;
    const topLeft = `${x1},${y1}`;
    const topRight = `${x2},${y1}`;
    const bottomLeft = `${x1},${y2}`;
    const bottomRight = `${x2},${y2}`;

    if (corners.has(topLeft)) {
      corners.delete(topLeft);
    } else {
      corners.add(topLeft);
    }

    if (corners.has(topRight)) {
      corners.delete(topRight);
    } else {
      corners.add(topRight);
    }

    if (corners.has(bottomLeft)) {
      corners.delete(bottomLeft);
    } else {
      corners.add(bottomLeft);
    }

    if (corners.has(bottomRight)) {
      corners.delete(bottomRight);
    } else {
      corners.add(bottomRight);
    }
  }

  return corners.size === 4 && corners.has(`${minX},${minY}`) && corners.has(`${maxX},${minY}`) && corners.has(`${minX},${maxY}`) && corners.has(`${maxX},${maxY}`);
}

const rectangles = [[1, 1, 3, 3], [3, 1, 4, 2], [3, 2, 4, 4], [1, 3, 2, 4], [2, 3, 3, 4]];
console.log(isRectangleCover(rectangles)); // 输出 true