java实现矩阵.docVIP

import java.util.Random; public class Matrix { private int[][] matrix; Random random = new Random(); // 构造方法 public Matrix() { matrix = new int[3][3]; } public Matrix(int n) { matrix = new int[n][n]; for (int i = 0; i n; i++) { for (int j = 0; j n; j++) { matrix[i][j] = random.nextInt(100); } } } public Matrix(int n, int m) { matrix = new int[n][m]; for (int i = 0; i n; i++) { for (int j = 0; j m; j++) { matrix[i][j] = random.nextInt(100); } } } public int[][] getMatrix() { return matrix; } // 输出矩阵中所有元素 public void output() { for (int i = 0; i matrix.length; i++) { for (int j = 0; j matrix[i].length; j++) { System.out.print(matrix[i][j] + \t); } System.out.println(); } } // 求一个矩阵的转置矩阵 public Matrix transpose() { int n = matrix.length; int m = matrix[0].length; Matrix transMatrix = new Matrix(n, m); for (int i = 0; i n; i++) { for (int j = 0; j m; j++) { transMatrix.getMatrix()[i][j] = matrix[j][i]; } } return transMatrix; } // 判断一个矩阵是否为上三角矩阵 public boolean isTriangular() { // 用相反的思路进行判断 for (int i = 1; i matrix.length; i++) { for (int j = 0; j i; j++) { if (matrix[i][j] != 0) { return false; } } } return true; } // 判断是否为对称矩阵 public boolean isSymmetry() { for (int i = 1; i matrix.length; i++) { for (int j = 0