计算4x4矩阵的行列式-( RayTracer挑战)- Javascript

function determinant(matrix) {
  if (matrix.length !== 4 || matrix[0].length !== 4) {
    throw new Error('Invalid matrix size');
  }

  // 计算代数余子式
  function subMatrix(matrix, row, col) {
    return matrix.filter((_, i) => i !== row)
                 .map(row => row.filter((_, j) => j !== col));
  }

  // 递归计算行列式
  function recursiveDeterminant(matrix) {
    if (matrix.length === 2) {
      return matrix[0][0] * matrix[1][1] - matrix[0][1] * matrix[1][0];
    }

    let result = 0;
    for (let i = 0; i < matrix.length; i++) {
      const coefficient = i % 2 === 0 ? 1 : -1;
      const subDet = recursiveDeterminant(subMatrix(matrix, 0, i));
      result += coefficient * matrix[0][i] * subDet;
    }
    return result;
  }

  return recursiveDeterminant(matrix);
}

// 示例用法
const matrix = [
  [1, 2, 3, 4],
  [5, 6, 7, 8],
  [9, 10, 11, 12],
  [13, 14, 15, 16]
];
const det = determinant(matrix);
console.log(det);