题解 | 明明的随机数

# 快排
def quick_sort(arr):
    if len(arr) <= 1:
        return arr
    
    pivot = arr[len(arr)//2]
    left = [x for x in arr if x < pivot]
    middle = [x for x in arr if x == pivot]
    right = [x for x in arr if x > pivot]
    return quick_sort(left) + middle + quick_sort(right)


n = int(input())

char_list = list()
for _ in range(n):
    char = int(input())
    if char in char_list:
        pass
    else:
        char_list.append(char) # 得到没有排序但是无重复的列表
char_list_sorted = quick_sort(char_list)

for s in char_list_sorted:
    print(s)