refactor 1120

fishercoder1534 · fishercoder1534 · commit 9e90e954a25b · 2020-08-12T11:58:33.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_1200.java b/src/main/java/com/fishercoder/solutions/_1200.java
@@ -4,38 +4,12 @@
 import java.util.Arrays;
 import java.util.List;
 
-/**
- * 1200. Minimum Absolute Difference
- *
- * 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:
- * 2 <= arr.length <= 10^5
- * -10^6 <= arr[i] <= 10^6
- * */
 public class _1200 {
     public static class Solution1 {
         /**
          * Time: O(nlogn) due to sorting
          * 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) {
             Arrays.sort(arr);
             int minimumDiff = arr[1] - arr[0];
