[파이썬] 백준 2529 부등호

순열로 풀었다.

import sys
from itertools import permutations
 
def check(list,k):
 
    for i in range(0,len(list)-1):
 
        bu = k[i]
 
        if bu=='<':
 
            if list[i]>list[i+1]:
                return "00"
 
        else:
 
            if list[i]<list[i+1]:
                return "00"
 
 
    return list
 
 
 
 
 
 
num = int(input())
 
k = list(sys.stdin.readline().rstrip().split(" "))
 
number = [0,1,2,3,4,5,6,7,8,9]
 
temp = list(permutations(number,num+1))
 
answer = [ ]
 
 
for i in range(0,len(temp)):
 
    if check(temp[i],k) != "00":
 
        answer.append(check(temp[i],k))
 
max_answer = list(max(answer))
min_answer = list(min(answer))
 
for i in max_answer:
    print(i,end="")
 
print()
for i in min_answer:
    print(i,end="")