[PGM] Level.0 가까운 수

프로그래머스

def solution(array, n):
    smallest_num = 999
    diff = []
    for a in array:
        diff.append(abs(a - n))
    print(diff)
    smallest_num = min(diff)
    return array[diff.index(smallest_num)]

 

def solution(array, n):
    diff = [(abs(n-i),i) for i in array]
    print(diff)
    
    closest_num = min(diff)[1]

    return closest_num

 

def solution(array, n):
    return sorted(array, key=lambda x:(abs(x-n),x))[0]