From 9ece98fece60e5179e97a2d40df9e33785665b28 Mon Sep 17 00:00:00 2001
From: Oleksii Aleshchenko <alexey.aleshchenko@gmail.com>
Date: Thu, 6 Apr 2023 15:04:51 +0300
Subject: [PATCH] upd lab2

---
 src/Lab2.java      | 35 +++++++++++++++++++++++++++++++++--
 src/test/Test.java | 13 +++++++++++++
 2 files changed, 46 insertions(+), 2 deletions(-)
 create mode 100644 src/test/Test.java

diff --git a/src/Lab2.java b/src/Lab2.java
index 56489af..f209094 100644
--- a/src/Lab2.java
+++ b/src/Lab2.java
@@ -3,7 +3,7 @@ public class Lab2 {
         final int A = 2;
         final int[][] MATRIX_B = {
                 {1, 202, 1, 1, 202, 3, 1, 202, 3,},
-                {1, 202, 1, 1, 202, 3, 1, 202, 3,},
+                {1, 202, 1, 1, 202, 3, 1, 202, 3, 4},
                 {1, 1,   3, 1, 202, 3, 1, 202, 3,},
 //                {4, 5, 6,},
         };
@@ -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,29 @@ 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];
+            for (int i = 1; i < MATRIX_C.length; i++) {
+                if (MATRIX_C[i][j] < tmpSmallest) {
+                    tmpSmallest = MATRIX_C[i][j];
+                }
+            }
+            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++) {
diff --git a/src/test/Test.java b/src/test/Test.java
new file mode 100644
index 0000000..e8fc368
--- /dev/null
+++ b/src/test/Test.java
@@ -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;
+    }
+}