Matrix

题目：递归运算行列式的值

代码：

public class Matrix {
public static int determinat(int[][] matrix){
int result = 0;
if(matrix.length>2){
for(int i = 0; i < matrix[0].length; i++){
double f = Math.pow(-1, i);
f = (int)f;
int [][] y = new int[matrix.length -1][matrix[0].length-1];
for(int j = 0; j < y.length; j++){
for(int j2 = 0; j2 < y[0].length; j2++){
if(j2 < i){
y[j][j2] = matrix[j+1][j2];
}else{
y[j][j2] = matrix[j+1][j2+1];
}
}
}
result += matrix[0][i] * determinat(y)*f;
}
}else{
if(matrix.length == 2)
result = matrix[0][0]*matrix[1][1] - matrix[0][1] *matrix[1][0];
else {
return result = matrix[0][0];
}
}
return result ;
}

public static void main(String[] args){
int[][] matrix =  {{1}};
                // {{1, 3}, {2,5}};
                // {{2,5,3}, {1,-2,-1}, {1, 3, 4}};
System.out.println(determinat(matrix));
}
}