refactor: NextGreaterElement (#5405)

* refactor: NextGreaterElement

* checkstyle: fix formatting

---------

Co-authored-by: alxkm <alx@alx.com>

src/main/java/com/thealgorithms/stacks/NextGreaterElement.java

@@ -1,53 +1,34 @@
 package com.thealgorithms.stacks;
 
-import java.util.Arrays;
 import java.util.Stack;
 
-/*
+/**
-    Given an array "input" you need to print the first greater element for each element.
+ * Utility class to find the next greater element for each element in a given integer array.
-    For a given element x of an array, the Next greater element of that element is the
+ *
-    first greater element to the right side of it. If no such element is present print -1.
+ * <p>The next greater element for an element x is the first greater element on the right side of x in the array.
-
+ * If no such element exists, the result will contain 0 for that position.</p>
-    Example
+ *
-    input = { 2, 7, 3, 5, 4, 6, 8 };
+ * <p>Example:</p>
-    At i = 0
+ * <pre>
-    Next greater element between (1 to n) is 7
+ * Input:  {2, 7, 3, 5, 4, 6, 8}
-    At i = 1
+ * Output: {7, 0, 5, 6, 6, 8, 0}
-    Next greater element between (2 to n) is 8
+ * </pre>
-    At i = 2
-    Next greater element between (3 to n) is 5
-    At i = 3
-    Next greater element between (4 to n) is 6
-    At i = 4
-    Next greater element between (5 to n) is 6
-    At i = 5
-    Next greater element between (6 to n) is 8
-    At i = 6
-    Next greater element between (6 to n) is -1
-
-    result : [7, 8, 5, 6, 6, 8, -1]
-
-    1. If the stack is empty Push an element in the stack.
-    2. If the stack is not empty:
-        a.  compare the top element of the stack with next.
-        b.  If next is greater than the top element, Pop element from the stack.
-            next is the next greater element for the popped element.
-        c.  Keep popping from the stack while the popped element is smaller
-            than next. next becomes the next greater element for all such
-            popped elements.
-        d. Finally, push the next in the stack.
-
-    3. If elements are left in stack after completing while loop then their Next greater element is
-   -1.
  */
-
 public final class NextGreaterElement {
     private NextGreaterElement() {
     }
 
+    /**
+     * Finds the next greater element for each element in the given array.
+     *
+     * @param array the input array of integers
+     * @return an array where each element is replaced by the next greater element on the right side in the input array,
+     * or 0 if there is no greater element.
+     * @throws IllegalArgumentException if the input array is null
+     */
     public static int[] findNextGreaterElements(int[] array) {
         if (array == null) {
-            return array;
+            throw new IllegalArgumentException("Input array cannot be null");
         }
 
         int[] result = new int[array.length];
@@ -62,10 +43,4 @@ public final class NextGreaterElement {
 
         return result;
     }
-
-    public static void main(String[] args) {
-        int[] input = {2, 7, 3, 5, 4, 6, 8};
-        int[] result = findNextGreaterElements(input);
-        System.out.println(Arrays.toString(result));
-    }
 }

src/test/java/com/thealgorithms/stacks/NextGreaterElementTest.java

@@ -0,0 +1,29 @@
+package com.thealgorithms.stacks;
+
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+
+import java.util.stream.Stream;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
+class NextGreaterElementTest {
+
+    @ParameterizedTest
+    @MethodSource("provideTestCases")
+    void testFindNextGreaterElements(int[] input, int[] expected) {
+        assertArrayEquals(expected, NextGreaterElement.findNextGreaterElements(input));
+    }
+
+    static Stream<Arguments> provideTestCases() {
+        return Stream.of(Arguments.of(new int[] {2, 7, 3, 5, 4, 6, 8}, new int[] {7, 8, 5, 6, 6, 8, 0}), Arguments.of(new int[] {5}, new int[] {0}), Arguments.of(new int[] {1, 2, 3, 4, 5}, new int[] {2, 3, 4, 5, 0}), Arguments.of(new int[] {5, 4, 3, 2, 1}, new int[] {0, 0, 0, 0, 0}),
+            Arguments.of(new int[] {4, 5, 2, 25}, new int[] {5, 25, 25, 0}), Arguments.of(new int[] {}, new int[] {}));
+    }
+
+    @Test
+    void testNullInput() {
+        assertThrows(IllegalArgumentException.class, () -> NextGreaterElement.findNextGreaterElements(null));
+    }
+}