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]]

思路：sort之后，算arr[i + 1] - arr[i]的diff，如果最小就加进去，新的最小，就新生成一个lists； 

class Solution {
    public List<List<Integer>> minimumAbsDifference(int[] arr) {
        Arrays.sort(arr);
        int minDiff = Integer.MAX_VALUE;
        List<List<Integer>> lists = new ArrayList<List<Integer>>();
        for(int i = 0; i < arr.length - 1; i++) {
            int curdiff = arr[i + 1] - arr[i];
            if(curdiff == minDiff) {
                lists.add(new ArrayList<Integer>(Arrays.asList(arr[i], arr[i + 1])));
            } 
            if(curdiff < minDiff){
                minDiff = curdiff;
                lists = new ArrayList<List<Integer>>();
                lists.add(new ArrayList<Integer>(Arrays.asList(arr[i], arr[i + 1])));
            }
        }
        return lists;
    }
}