https://leetcode.com/problems/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 arra < bb - a equals to the minimum absolute difference of a..