Li Kou today's question -1200 Minimum absolute difference

1200. Minimum absolute difference

difficulty ： Simple :happy:

Ideas ： The problem is not to find the minimum absolute value difference ? We can sort in ascending order first , Then let the subscript start with the second value , Subtract the previous element in turn . And use a value min Save the difference between them , At the same time, let it be an element set before us min_value（ Always save the minimum ） Compare , If min=min_value, Add to result set res. If you encounter a small difference with min<min_value, Then empty the result set between res.clear(), And again min Assign a value to min_value, meanwhile , Re add elements . Then output the result set res.

class Solution {
    
    public List<List<Integer>> minimumAbsDifference(int[] arr) {
    
        // First sort in ascending order 
        Arrays.sort(arr);
        // Create result sets 
        List<List<Integer>> res = new ArrayList<>();
        //n For preservation arr The length of 
        int n = arr.length;
        //min_value Used to save the minimum value 
        int min_value = Integer.MAX_VALUE;
        // Traverse 
        for(int i = 1 ;i < n; i++){
    
            // Calculate the difference , And save it to diff
            int min = arr[i]-arr[i-1];
            if(min <= min_value){
    
                if(min < min_value){
    
                    // call list Of clear Method , Release List aggregate 
                    res.clear();
                    // Assign the minimum value to min_value
                    min_value = min;
                }
                // Description is the minimum difference , The difference is the same, similar to case 1 
                res.add(List.of(arr[i-1],arr[i]));
            }
        }
        return res;

    }
}

Reference code ：2022/7/4