문제 링크

정답 :

def solution(arr, k):
    arrSet = []
    
    for i in arr:
        if i not in arrSet:
            arrSet.append(i)
    
    arr = arrSet[:k]
    
    while len(arr) < k:
        arr += [-1]
    
    return arr

개선 :

def solution(arr, k):
    arrSet = []
    
    for i in arr:
        if i not in arrSet:
            arrSet.append(i)
        if len(arrSet) == k:
            break
    
    arr = arrSet
    
    return arr + [-1] * (k - len(arr))

방법 1.

def solution(arr, k):
    res = list(dict.fromkeys(arr))
    res.extend([-1] * max(0, k - len(res)))
    return res[:k]