add 1200c

fishercoder1534 · fishercoder1534 · commit a1f7ff6ae1bb · 2019-11-23T06:35:29.000-08:00
diff --git a/README.md b/README.md
@@ -30,6 +30,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |1252|[Cells with Odd Values in a Matrix](https://leetcode.com/problems/cells-with-odd-values-in-a-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1252.java) | O(m*n + k) | O(m*n) | |Easy||
 |1237|[Find Positive Integer Solution for a Given Equation](https://leetcode.com/problems/find-positive-integer-solution-for-a-given-equation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1237.java) | | | |Easy||
 |1207|[Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1207.java) | O(n) | O(1) | |Easy||
+|1200|[Minimum Absolute Difference](https://leetcode.com/problems/minimum-absolute-difference/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1200.java) | || |Easy||
 |1185|[Day of the Week](https://leetcode.com/problems/day-of-the-week/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1185.java) | | | |Easy||
 |1160|[Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1160.java) | O(n) | O(m) | |Easy||
 |1154|[Day of the Year](https://leetcode.com/problems/day-of-the-year/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1154.java) | O(1) | O(1) | |Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_1200.java b/src/main/java/com/fishercoder/solutions/_1200.java
@@ -1,6 +1,9 @@
 package com.fishercoder.solutions;
 
+import java.util.ArrayList;
+import java.util.Arrays;
 import java.util.List;
+import java.util.TreeMap;
 
 /**
  * 1200. Minimum Absolute Difference
@@ -30,8 +33,26 @@
  * */
 public class _1200 {
     public static class Solution1 {
+        /**
+         * Time: O(n)
+         * Space: O(k) where k is the distinct number of differences between two numbers in the given array
+         * */
         public List<List<Integer>> minimumAbsDifference(int[] arr) {
-            return null;
+            Arrays.sort(arr);
+            TreeMap<Integer, List<List<Integer>>> map = new TreeMap<>();
+            for (int i = 0; i < arr.length - 1; i++) {
+                int diff = arr[i + 1] - arr[i];
+                if (map.containsKey(diff)) {
+                    List list = map.get(diff);
+                    list.add(Arrays.asList(arr[i], arr[i + 1]));
+                    map.put(diff, list);
+                } else {
+                    List list = new ArrayList<>();
+                    list.add(Arrays.asList(arr[i], arr[i + 1]));
+                    map.put(diff, list);
+                }
+            }
+            return map.firstEntry().getValue();
         }
     }
 }
diff --git a/src/test/java/com/fishercoder/_1200Test.java b/src/test/java/com/fishercoder/_1200Test.java
@@ -0,0 +1,33 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1200;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1200Test {
+    private static _1200.Solution1 solution1;
+    private static int[] arr;
+    private static List<List<Integer>> expected;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1200.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        arr = new int[]{4, 2, 1, 3};
+        expected = new ArrayList<>();
+        expected.add(Arrays.asList(1, 2));
+        expected.add(Arrays.asList(2, 3));
+        expected.add(Arrays.asList(3, 4));
+        assertEquals(expected, solution1.minimumAbsDifference(arr));
+    }
+
+}
