Adjust SecondLargestElement solution, add test case

Author: andrei-punko

src/main/java/by/andd3dfx/numeric/SecondLargestElement.java

@@ -27,12 +27,12 @@ public static int find_N(int[] array) {
         int max_2 = Math.min(array[0], array[1]);
 
         for (int i = 2; i < array.length; i++) {
-            if (array[i] >= max_1) {
+            if (array[i] > max_1) {
                 max_2 = max_1;
                 max_1 = array[i];
                 continue;
             }
-            if (array[i] >= max_2) {
+            if (array[i] > max_2) {
                 max_2 = array[i];
             }
         }

src/test/java/by/andd3dfx/numeric/SecondLargestElementTest.java

@@ -13,6 +13,9 @@ public void find_NlogN() {
 
         int[] array2 = {3, 1, 2, 5, 8, 3, 7};
         assertThat(SecondLargestElement.find_NlogN(array2)).isEqualTo(7);
+
+        int[] array3 = {3, 1, 2, 5, 8, 3, 7, 8};
+        assertThat(SecondLargestElement.find_N(array3)).isEqualTo(8);
     }
 
     @Test
@@ -22,5 +25,8 @@ public void find_N() {
 
         int[] array2 = {3, 1, 2, 5, 8, 3, 7};
         assertThat(SecondLargestElement.find_N(array2)).isEqualTo(7);
+
+        int[] array3 = {3, 1, 2, 5, 8, 3, 7, 8};
+        assertThat(SecondLargestElement.find_N(array3)).isEqualTo(8);
     }
 }