[Python] HackerRank - Closest Numbers

Problem

 

Solving Process

 

주어진 배열을 Sort 하고,

for 문을 돌면서 diff 값을 비교하여 minimum 값을 찾으며

새로운 min 값이면 redefine,

같은 min 값이면 add 해주는 식으로 진행하였다!

 

Solution

def closestNumbers(arr):
    arr.sort()
    length = len(arr)
    min = sys.maxsize
    
    ans_arr = []
    for i in range(length):
        if i != length-1:
            diff = arr[i+1] - arr[i]
            if min > diff:
                min = diff
                ans_arr = [arr[i], arr[i+1]]
            elif min == diff:
                ans_arr.append(arr[i])
                ans_arr.append(arr[i+1])
    return ans_arr