Compare commits
11 Commits
399941844f
...
32545562f8
Author | SHA1 | Date |
---|---|---|
dymik739 | 32545562f8 | |
Oleksii Aleshchenko | 9ece98fece | |
Oleksii Aleshchenko | 81ac59840f | |
Oleksii Aleshchenko | 1e6825d7d4 | |
Oleksii Aleshchenko | 4087daef02 | |
Oleksii Aleshchenko | 31ba116ad8 | |
xivihwa | 6fc3cc244e | |
xivihwa | 3bbb7c8e54 | |
xivihwa | 1af299f8f7 | |
xivihwa | 4924bbe62f | |
xivihwa | 29e63163a4 |
|
@ -12,7 +12,15 @@ public class Lab2 {
|
|||
|
||||
print(MATRIX_C);
|
||||
|
||||
System.out.println("Sum of smallest elements in every column: " + sumOfSmallestElementsInEveryColumn(MATRIX_C));
|
||||
// System.out.println("Sum of smallest elements in every column: " + sumOfSmallestElementsInEveryColumn(MATRIX_C));
|
||||
try {
|
||||
System.out.println("Sum of smallest elements in every column: " + sumOfSmallestElementsInEveryColumnRenew(MATRIX_C));
|
||||
System.out.println("???...");
|
||||
} catch (Exception e) {
|
||||
System.err.println(e.getMessage());
|
||||
}
|
||||
|
||||
System.out.println("I'm still working...");
|
||||
|
||||
/*int[] array = {1, 2, 3};
|
||||
int[] array2 = new int[3];
|
||||
|
@ -78,6 +86,36 @@ public class Lab2 {
|
|||
return sum;
|
||||
}
|
||||
|
||||
private static int sumOfSmallestElementsInEveryColumnRenew(final int[][] MATRIX_C) throws Exception {
|
||||
// todo check different length of rows
|
||||
for (int i = 1; i < MATRIX_C.length; i++) {
|
||||
if (MATRIX_C[i].length != MATRIX_C[0].length) {
|
||||
throw new /*Runtime*/Exception("There are different lengths of matrix rows.");
|
||||
// System.err.println("There are different lengths of matrix rows.");
|
||||
// System.exit(0);
|
||||
}
|
||||
}
|
||||
// todo check repetition of minimal elements
|
||||
int sum = 0;
|
||||
for (int j = 0; j < MATRIX_C[0].length; j++) {
|
||||
int tmpSmallest = MATRIX_C[0][j];
|
||||
boolean value_repeats = false;
|
||||
for (int i = 1; i < MATRIX_C.length; i++) {
|
||||
if (MATRIX_C[i][j] < tmpSmallest) {
|
||||
tmpSmallest = MATRIX_C[i][j];
|
||||
value_repeats = false;
|
||||
} else if (MATRIX_C[i][j] == tmpSmallest) {
|
||||
value_repeats = true;
|
||||
}
|
||||
}
|
||||
|
||||
if (!value_repeats) {
|
||||
sum += tmpSmallest;
|
||||
}
|
||||
}
|
||||
return sum;
|
||||
}
|
||||
|
||||
private static void print(final int[][] MATRIX_C) {
|
||||
for (int i = 0; i < MATRIX_C.length; i++) {
|
||||
for (int j = 0; j < MATRIX_C[i].length; j++) {
|
||||
|
|
|
@ -0,0 +1,13 @@
|
|||
package test;
|
||||
|
||||
public class Test {
|
||||
public static void main(String[] args) {
|
||||
|
||||
}
|
||||
static int m(){
|
||||
System.exit(0);
|
||||
// return 1;
|
||||
System.out.println(123);
|
||||
return 1;
|
||||
}
|
||||
}
|
Loading…
Reference in New Issue