Add MaximumGap leetcode task solution

Author: andrei-punko

src/main/java/by/andd3dfx/common/MaximumGap.java

@@ -0,0 +1,42 @@
+package by.andd3dfx.common;
+
+import java.util.Arrays;
+
+/**
+ * <pre>
+ * https://leetcode.com/problems/maximum-gap/description/
+ *
+ * Given an integer array nums, return the maximum difference between two successive elements in its sorted form.
+ * If the array contains less than two elements, return 0.
+ * You must write an algorithm that runs in linear time and uses linear extra space.
+ *
+ * Example 1:
+ *   Input: nums = [3,6,9,1]
+ *   Output: 3
+ *   Explanation: The sorted form of the array is [1,3,6,9], either (3,6) or (6,9) has the maximum difference 3.
+ *
+ * Example 2:
+ *   Input: nums = [10]
+ *   Output: 0
+ *   Explanation: The array contains less than 2 elements, therefore return 0.
+ * </pre>
+ */
+public class MaximumGap {
+
+    public static int determine(int[] nums) {
+        if (nums.length < 2) {
+            return 0;
+        }
+
+        Arrays.sort(nums);
+
+        int result = 0;
+        for (int i = 1; i < nums.length; i++) {
+            var diff = nums[i] - nums[i - 1];
+            if (diff > result) {
+                result = diff;
+            }
+        }
+        return result;
+    }
+}

src/test/java/by/andd3dfx/common/MaximumGapTest.java

@@ -0,0 +1,16 @@
+package by.andd3dfx.common;
+
+import org.junit.Test;
+
+import static by.andd3dfx.common.MaximumGap.determine;
+import static org.assertj.core.api.Assertions.assertThat;
+
+public class MaximumGapTest {
+
+    @Test
+    public void testDetermine() {
+        assertThat(determine(new int[]{3, 6, 9, 1})).isEqualTo(3);
+        assertThat(determine(new int[]{3, 49, 1, 9, 2})).isEqualTo(40);
+        assertThat(determine(new int[]{10})).isEqualTo(0);
+    }
+}