java实现矩阵的加-减-乘-转置运算.docxVIP

import java.util.*; public class JuZhen { // 创建矩阵 public static int[][] createJuZhen(int x, int y) { Scanner input = new Scanner(System.in); System.out.println(请输入 + x + 行 + y + 列的矩阵数据（行优先）：); int[][] array = new int[x][y]; for (int i = 0; i array.length; i++) for (int j = 0; j array[i].length; j++) { array[i][j] = input.nextInt(); } return array; } // 矩阵输出 public static void outputJuZhen(int[][] list) { for (int i = 0; i list.length; i++) { for (int j = 0; j list[i].length; j++) { System.out.print(list[i][j] + ); } System.out.println(); } } // 矩阵求和 public static int[][] addJuZhen(int[][] list1, int[][] list2) { int[][] list3 = new int[list1.length][list1[0].length]; if (list1.length != list2.length || list1[0].length != list2[0].length) { System.out.println(行数或列数不同的矩阵不能相加！并将返回0:！！); } else { for (int i = 0; i list1.length; i++) for (int j = 0; j list1[0].length; j++) list3[i][j] = list1[i][j] + list2[i][j]; } return list3; } // 矩阵相乘 public static int[][] mulJuZhen(int[][] list1, int[][] list2) { int[][] list3 = new int[list1.length][list2[0].length]; if (list1.length != list2[0].length || list1[0].length != list2.length) System.out.println(两矩阵不能符合条件相乘！并将返回0:！！); else for (int i = 0; i list1.length; i++) for (int j = 0; j list2[0].length; j++) for (int k = 0; k list2[0].length; k++) list3[i][j] += list1[i][k] * list2[k][j]; return list3; } // 矩阵相减 public static int[][] substractJuZhen(int[][] list1, int[][] list2) { int[][] list5 = new int[list1.length][list1[0].length]; if (list1.length != list2.length || list1[0].length != list2[0].length) { System.out.println(行数或列数不同的矩阵不能相加！并将返回0:！！); } else { for (int i = 0; i list1.length; i++) for (int j = 0; j list1[0].length; j++) list5[i][j] = list1[i][j] - list2[i][j]; } return list5; } // 矩阵转置 public static int[][] zhuanzhiJuZhen(int[][] list) { int[][] list6 = new int[list.len