dymik739
/
temp-oop
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Compare commits

base: dymik739:32545562f8956481c74f43abfe343cf2efdaecf2
Branches Tags
dymik739:master
..
compare: dymik739:399941844fbcd9ca16ef312e913fa09daca54ab0
Branches Tags
dymik739:master

No commits in common. "32545562f8956481c74f43abfe343cf2efdaecf2" and "399941844fbcd9ca16ef312e913fa09daca54ab0" have entirely different histories.
32545562f8 ... 399941844f

2 changed files with 1 additions and 52 deletions
Show Stats Expand all files Collapse all files

40
src/Lab2.java
View File

@ -12,15 +12,7 @@ public class Lab2 {
print(MATRIX_C); 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[] array = {1, 2, 3};
int[] array2 = new int[3]; int[] array2 = new int[3];
@ -86,36 +78,6 @@ public class Lab2 {
return sum; 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) { private static void print(final int[][] MATRIX_C) {
for (int i = 0; i < MATRIX_C.length; i++) { for (int i = 0; i < MATRIX_C.length; i++) {
for (int j = 0; j < MATRIX_C[i].length; j++) { for (int j = 0; j < MATRIX_C[i].length; j++) {

13
src/test/Test.java
View File

@ -1,13 +0,0 @@
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;
}
}