LeetCode 풀기 - 1200. Minimum Absolute Difference

1200. Minimum Absolute Difference

https://leetcode.com/problems/minimum-absolute-difference/

Minimum Absolute Difference - LeetCode

문제)

솔루션1) Easy one path

class Solution(object):
    def minimumAbsDifference(self, arr):
        """
        :type arr: List[int]
        :rtype: List[List[int]]
        """
        arr.sort()
        d = {}
        for i in range(len(arr)-1):
            diff = abs(arr[i+1]-arr[i])
            if diff in d:
                d[diff].append([arr[i],arr[i+1]])
            else:
                d[diff] = [[arr[i],arr[i+1]]]
        return d[min(d.keys())]