螺旋数组填充：给一个数组，返回一个 m*n 的矩阵，数从小到大顺时针螺旋填充矩阵，要求 |m-n| 尽可能小

function spiralFill(nums) {
  const values = [...nums].sort((a, b) => a - b);
  const len = values.length;
  if (len === 0) return [];

  let rows = Math.floor(Math.sqrt(len));
  while (len % rows !== 0) rows--;
  const cols = len / rows;

  const matrix = Array.from({ length: rows }, () => Array(cols));
  let top = 0;
  let bottom = rows - 1;
  let left = 0;
  let right = cols - 1;
  let i = 0;

  while (top <= bottom && left <= right) {
    for (let c = left; c <= right; c++) matrix[top][c] = values[i++];
    top++;

    for (let r = top; r <= bottom; r++) matrix[r][right] = values[i++];
    right--;

    if (top <= bottom) {
      for (let c = right; c >= left; c--) matrix[bottom][c] = values[i++];
      bottom--;
    }

    if (left <= right) {
      for (let r = bottom; r >= top; r--) matrix[r][left] = values[i++];
      left++;
    }
  }

  return matrix;
}