本文實例講述了Java實現矩陣加減乘除及轉制等運算功能。分享給大家供大家參考,具體如下:
Java初學,編寫矩陣預算程序,當做工具,以便以后寫算法時使用。
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
|
public class MatrixOperation { public static int [][] add( int [][] matrix_a, int [][] matrix_b) { int row = matrix_a.length; int col = matrix_a[ 0 ].length; int [][] result = new int [row][col]; if (row != matrix_b.length || col != matrix_b[ 0 ].length) { System.out.println( "Fault" ); } else { for ( int i = 0 ; i < row; i++) { for ( int j = 0 ; j < col; j++) { result[i][j] = matrix_a[i][j] + matrix_b[i][j]; } } } return result; } public static int [][] sub( int [][] matrix_a, int [][] matrix_b) { int row = matrix_a.length; int col = matrix_a[ 0 ].length; int [][] result = new int [row][col]; if (row != matrix_b.length || col != matrix_b[ 0 ].length) { System.out.println( "Fault" ); } else { for ( int i = 0 ; i < row; i++) { for ( int j = 0 ; j < col; j++) { result[i][j] = matrix_a[i][j] - matrix_b[i][j]; } } } return result; } public static int [][] dot( int [][] matrix_a, int [][] matrix_b) { /* * matrix_a's dimention m*p matrix_b's dimention p*n. return dimention * m*n */ int row = matrix_a.length; int col = matrix_a[0].length; int[][] result = new int[row][col]; if (col != matrix_b.length) { System.out.println("Fault"); } else { for (int i = 0; i < row; i++) { for (int j = 0; j < col; j++) { result[i][j] = 0; for (int k = 0; k < col; k++) { result[i][j] += matrix_a[i][k] * matrix_b[k][j]; } } } } return result; } public static int[][] dot(int[][] matrix_a, int b) { int row = matrix_a.length; int col = matrix_a[0].length; int[][] result = new int[row][col]; for (int i = 0; i < row; i++) { for (int j = 0; j < col; j++) { result[i][j] = matrix_a[i][j] * b; } } return result; } public static int[][] mul(int[][] matrix_a, int[][] matrix_b) { /* * matrix_a's dimention m*n matrix_b's dimention m*n. return dimention * m*n */ int row = matrix_a.length; int col = matrix_a[ 0 ].length; int [][] result = new int [row][col]; if (row != matrix_b.length || col != matrix_b[ 0 ].length) { System.out.println( "Fault" ); } else { for ( int i = 0 ; i < row; i++) { for ( int j = 0 ; j < col; j++) { result[i][j] = matrix_a[i][j] * matrix_b[i][j]; } } } return result; } public static int [][] transport( int [][] matrix_a) { int row = matrix_a.length; int col = matrix_a[ 0 ].length; int [][] result = new int [row][col]; for ( int i = 0 ; i < row; i++) { for ( int j = 0 ; j < col; j++) { result[j][i] = matrix_a[i][j]; } } return result; } public static void print( int [][] matrix) { int row = matrix.length; int col = matrix[ 0 ].length; for ( int i = 0 ; i < row; i++) { System.out.print( "[" ); for ( int j = 0 ; j < col; j++) { System.out.print(matrix[i][j]); if (j != col - 1 ) { System.out.print( ", " ); } } System.out.print( "]\n" ); } } public static void main(String[] args) { int [][] a = { { 1 , 2 }, { 3 , 4 } }; int [][] b = { { 7 , 8 }, { 6 , 5 } }; int [][] c = add(a, b); System.out.println( "服務器之家測試結果如下:" ); System.out.println( "matrix a = " ); print(a); System.out.println( "matrix b = " ); print(b); System.out.println( "matrix a + b = " ); print(c); c = sub(a, b); System.out.println( "matrix a - b = " ); print(c); int [][] d = dot(a, b); System.out.println( "matrix a dot b = " ); print(d); int [][] e = dot(a, 3 ); System.out.println( "matrix a * 3 = " ); print(e); int [][] f = transport(a); System.out.println( "matrix a.T = " ); print(f); int [][] g = mul(a, b); System.out.println( "matrix a * b = " ); print(g); } } |
運行結果:
希望本文所述對大家java程序設計有所幫助。
原文鏈接:http://blog.csdn.net/miangangzhen/article/details/52275480