【HackerRank】Closest Numbers

Sorting is often useful as the first step in many different tasks. The most common task is to make finding things easier, but there are other uses also.

Challenge 
Given a list of unsorted numbers, can you find the numbers that have the smallest absolute difference between them? If there are multiple pairs, find them all.

Input Format 
There will be two lines of input:

• n - the size of the list
• array - the n numbers of the list

Output Format 
Output the pairs of numbers with the smallest difference. If there are multiple pairs, output all of them in ascending order, all on the same line (consecutively) with just a single space between each pair of numbers. If there's a number which lies in two pair, print it two times (see sample case #3 for explanation).

Constraints 
10 <= n <= 200000 
-(107) <= x <= (107), where x ∈ array 
array[i] != array[j], 0 <= i, j < N, and i != j

---

水题：维护一个ArrayList和记录当前最小距离的变量miniDist，每当i和i+1两个数的距离和miniDist相等时，把i放到ArrayList里面；当两个数距离小于miniDist时，把ArrayList清空，i放进去，并更新miniDist；最后根据ArrayList输出答案。

代码如下：

import java.util.*;

public class Solution {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] ar = new int[n];
        for(int i = 0;i < n;i++)
            ar[i]= in.nextInt();
        
        Arrays.sort(ar);
        ArrayList<Integer> index = new ArrayList<Integer>();
        int miniDis = Integer.MAX_VALUE;
        for(int i = 0;i < n-1;i++){
            if(ar[i+1]-ar[i] < miniDis){
                index.clear();
                index.add(i);
                miniDis = ar[i+1]-ar[i];
            }
            else if(ar[i+1]-ar[i]==miniDis)
                index.add(i);
        }
        for(int i:index){
            System.out.printf("%d %d ", ar[i],ar[i+1]);
        }
        System.out.println();
        
    }
}