Compare commits

...

11 Commits

Author SHA1 Message Date
dymik739 32545562f8 suggestion for lab2 2023-04-06 15:20:29 +03:00
Oleksii Aleshchenko 9ece98fece upd lab2 2023-04-06 15:04:51 +03:00
Oleksii Aleshchenko 81ac59840f Revert "Done lab 1-3"
This reverts commit 29e63163a4.
2023-04-04 22:33:00 +03:00
Oleksii Aleshchenko 1e6825d7d4 Revert "Delete lab1 directory"
This reverts commit 1af299f8f7.
2023-04-04 22:32:47 +03:00
Oleksii Aleshchenko 4087daef02 Revert "Delete lab2 directory"
This reverts commit 3bbb7c8e54.
2023-04-04 22:32:36 +03:00
Oleksii Aleshchenko 31ba116ad8 Revert "Delete lab3 directory"
This reverts commit 6fc3cc244e.
2023-04-04 22:32:00 +03:00
xivihwa 6fc3cc244e
Delete lab3 directory 2023-04-04 17:44:45 +03:00
xivihwa 3bbb7c8e54
Delete lab2 directory 2023-04-04 17:44:38 +03:00
xivihwa 1af299f8f7
Delete lab1 directory 2023-04-04 17:44:30 +03:00
xivihwa 4924bbe62f
Merge pull request #2 from ASDjonok/ІО-25/01-Антоненко-Віолетта-Станіславівна
Done lab 1-3
2023-04-04 17:41:26 +03:00
xivihwa 29e63163a4 Done lab 1-3 2023-04-04 17:40:44 +03:00
2 changed files with 52 additions and 1 deletions

View File

@ -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++) {

13
src/test/Test.java Normal file
View File

@ -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;
}
}