Added task 1200.

Author: javadev

build.gradle

@@ -48,7 +48,7 @@ spotless {
     java {
         encoding 'UTF-8'
         target fileTree(projectDir) {
-            include '**/src/*.java'
+            include '**/src/**/*.java'
             exclude '**/build/**'
         }
         importOrder '\\#', '', '*'

src/main/java/g1101_1200/s1200_minimum_absolute_difference/Solution.java

@@ -0,0 +1,26 @@
+package g1101_1200.s1200_minimum_absolute_difference;
+
+// #Easy #Array #Sorting #2022_02_27_Time_14_ms_(98.30%)_Space_52_MB_(84.02%)
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
+
+public class Solution {
+    public List<List<Integer>> minimumAbsDifference(int[] arr) {
+        List<List<Integer>> result = new ArrayList<>();
+        int min = 10000000;
+        Arrays.sort(arr);
+        for (int i = 0; i + 1 < arr.length; i++) {
+            int diff = arr[i + 1] - arr[i];
+            if (diff <= min) {
+                if (diff < min) {
+                    min = diff;
+                    result.clear();
+                }
+                result.add(Arrays.asList(arr[i], arr[i + 1]));
+            }
+        }
+        return result;
+    }
+}

src/main/java/g1101_1200/s1200_minimum_absolute_difference/readme.md

@@ -0,0 +1,36 @@
+1200\. Minimum Absolute Difference
+
+Easy
+
+Given an array of **distinct** integers `arr`, find all pairs of elements with the minimum absolute difference of any two elements.
+
+Return a list of pairs in ascending order(with respect to pairs), each pair `[a, b]` follows
+
+*   `a, b` are from `arr`
+*   `a < b`
+*   `b - a` equals to the minimum absolute difference of any two elements in `arr`
+
+**Example 1:**
+
+**Input:** arr = [4,2,1,3]
+
+**Output:** [[1,2],[2,3],[3,4]]
+
+**Explanation:** The minimum absolute difference is 1. List all pairs with difference equal to 1 in ascending order.
+
+**Example 2:**
+
+**Input:** arr = [1,3,6,10,15]
+
+**Output:** [[1,3]]
+
+**Example 3:**
+
+**Input:** arr = [3,8,-10,23,19,-4,-14,27]
+
+**Output:** [[-14,-10],[19,23],[23,27]]
+
+**Constraints:**
+
+*   <code>2 <= arr.length <= 10<sup>5</sup></code>
+*   <code>-10<sup>6</sup> <= arr[i] <= 10<sup>6</sup></code>

src/test/java/g1101_1200/s1200_minimum_absolute_difference/SolutionTest.java

@@ -0,0 +1,30 @@
+package g1101_1200.s1200_minimum_absolute_difference;
+
+import static org.hamcrest.CoreMatchers.equalTo;
+import static org.hamcrest.MatcherAssert.assertThat;
+
+import com_github_leetcode.ArrayUtils;
+import org.junit.jupiter.api.Test;
+
+class SolutionTest {
+    @Test
+    void minimumAbsDifference() {
+        assertThat(
+                new Solution().minimumAbsDifference(new int[] {4, 2, 1, 3}),
+                equalTo(ArrayUtils.getLists(new int[][] {{1, 2}, {2, 3}, {3, 4}})));
+    }
+
+    @Test
+    void minimumAbsDifference2() {
+        assertThat(
+                new Solution().minimumAbsDifference(new int[] {1, 3, 6, 10, 15}),
+                equalTo(ArrayUtils.getLists(new int[][] {{1, 3}})));
+    }
+
+    @Test
+    void minimumAbsDifference3() {
+        assertThat(
+                new Solution().minimumAbsDifference(new int[] {3, 8, -10, 23, 19, -4, -14, 27}),
+                equalTo(ArrayUtils.getLists(new int[][] {{-14, -10}, {19, 23}, {23, 27}})));
+    }
+}