forked from reeucq/advanced-data-structures
-
Notifications
You must be signed in to change notification settings - Fork 0
/
MatrixMultiplication.java
229 lines (216 loc) · 6.89 KB
/
MatrixMultiplication.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
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
import java.util.Scanner;
/**
* This class features static methods of reading, printing and muliplying matrices.
* Matrices can be:
* - Lower Left Triangular
* - Lower Right Triangular
* - Upper Left Triangular
* - Upper Right Triangular
* - Diagonal
* - Square
*
* All matrices are represented in 2D arrays.
* We don't store the null values in the 2D array as no space is allocated for them.
* Therefore they are irregular 2D arrays.
*/
public class MatrixMultiplication {
/**
* A 3x3 Right Lower Triangular Matrix looks like this:
*
* 0 0 1
* 0 1 1
* 1 1 1
*
* On the index (i+j) < n - 1, the value is 0.
* On all the other indexes, the value is not 0.
*/
public static void readRightLowerTriangularMatrix(int[][] matrix) {
Scanner sc = new Scanner(System.in);
for (int i = 0; i < matrix.length; i++) {
matrix[i] = new int[i + 1];
for (int j = 0; j < matrix[i].length; j++) {
System.out.print("Enter the value for matrix[" + i + "][" + j + "]: ");
matrix[i][j] = sc.nextInt();
}
}
}
/**
* A 3x3 Left Lower Triangular Matrix looks like this:
*
* 1 0 0
* 1 1 0
* 1 1 1
*
* On the index i < j, the value is 0.
* On all the other indexes, the value is not 0.
*/
public static void readLeftLowerTriangularMatrix(int[][] matrix) {
Scanner sc = new Scanner(System.in);
for (int i = 0; i < matrix.length; i++) {
matrix[i] = new int[i+1];
for (int j = 0; j < matrix[i].length; j++) {
System.out.print("Enter the value for matrix[" + i + "][" + j + "]: ");
matrix[i][j] = sc.nextInt();
}
}
}
/**
* A 3x3 Right Upper Triangular Matrix looks like this:
*
* 1 1 1
* 0 1 1
* 0 0 1
*
* On the index i > j, the value is 0.
* On all the other indexes, the value is not 0.
*/
public static void readRightUpperTriangularMatrix(int[][] matrix) {
Scanner sc = new Scanner(System.in);
for (int i = 0; i < matrix.length; i++) {
matrix[i] = new int[matrix.length-i];
for (int j = 0; j < matrix[i].length; j++) {
System.out.print("Enter the value for matrix[" + i + "][" + j + "]: ");
matrix[i][j] = sc.nextInt();
}
}
}
/**
* A 3x3 Left Upper Triangular Matrix looks like this:
*
* 1 1 1
* 1 1 0
* 1 0 0
*
* On the index (i+j) > n - 1, the value is 0.
* On all the other indexes, the value is not 0.
*/
public static void readLeftUpperTriangularMatrix(int[][] matrix) {
Scanner sc = new Scanner(System.in);
for (int i = 0; i < matrix.length; i++) {
matrix[i] = new int[matrix.length-i];
for (int j = 0; j < matrix[i].length; j++) {
System.out.print("Enter the value for matrix[" + i + "][" + j + "]: ");
matrix[i][j] = sc.nextInt();
}
}
}
/**
* A 3x3 Diagonal Matrix looks like this:
*
* 1 0 0
* 0 1 0
* 0 0 1
*
* On the index i != j, the value is 0.
* On all the other indexes, the value is not 0.
*/
public static void readDiagonalMatrix(int[][] matrix) {
Scanner sc = new Scanner(System.in);
for (int i = 0; i < matrix.length; i++) {
matrix[i] = new int[1];
for (int j = 0; j < matrix[i].length; j++) {
System.out.print("Enter the value for matrix[" + i + "][" + j + "]: ");
matrix[i][j] = sc.nextInt();
}
}
}
/**
* Print right lower triangular matrix.
*/
public static void printRightLowerTriangularMatrix(int[][] matrix) {
for (int i = 0; i < matrix.length; i++) {
for (int j = 0; j < matrix.length; j++) {
if(i+j < matrix.length - 1) {
System.out.print("0 ");
} else {
System.out.print(matrix[i][i+j-matrix.length+1] + " ");
}
}
System.out.println();
}
}
/**
* Print left lower triangular matrix.
*/
public static void printLeftLowerTriangularMatrix(int[][] matrix) {
for (int i = 0; i < matrix.length; i++) {
for (int j = 0; j < matrix.length; j++) {
if(i < j) {
System.out.print("0 ");
} else {
System.out.print(matrix[i][j] + " ");
}
}
System.out.println();
}
}
/**
* Print right upper triangular matrix.
*/
public static void printRightUpperTriangularMatrix(int[][] matrix) {
for (int i = 0; i < matrix.length; i++) {
for (int j = 0; j < matrix.length; j++) {
if(i > j) {
System.out.print("0 ");
} else {
System.out.print(matrix[i][j-i] + " ");
}
}
System.out.println();
}
}
/**
* Print left upper triangular matrix.
*/
public static void printLeftUpperTriangularMatrix(int[][] matrix) {
for (int i = 0; i < matrix.length; i++) {
for (int j = 0; j < matrix.length; j++) {
if(i+j > matrix.length - 1) {
System.out.print("0 ");
} else {
System.out.print(matrix[i][j] + " ");
}
}
System.out.println();
}
}
/**
* Print diagonal matrix.
*/
public static void printDiagonalMatrix(int[][] matrix) {
for (int i = 0; i < matrix.length; i++) {
for (int j = 0; j < matrix.length; j++) {
if(i != j) {
System.out.print("0 ");
} else {
System.out.print(matrix[i][0] + " ");
}
}
System.out.println();
}
}
/**
* Main Method
* Test All of the methods above
*/
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("Enter the size of the matrix: ");
int n = sc.nextInt();
int[][] rltm = new int[n][];
int[][] lltm = new int[n][];
int[][] rutm = new int[n][];
int[][] lutm = new int[n][];
int[][] dm = new int[n][];
readRightLowerTriangularMatrix(rltm);
printRightLowerTriangularMatrix(rltm);
readLeftLowerTriangularMatrix(lltm);
printLeftLowerTriangularMatrix(lltm);
readRightUpperTriangularMatrix(rutm);
printRightUpperTriangularMatrix(rutm);
readLeftUpperTriangularMatrix(lutm);
printLeftUpperTriangularMatrix(lutm);
readDiagonalMatrix(dm);
printDiagonalMatrix(dm);
}
}