[프로그래머스] 큰 수 찾기

 

def solution(number, k):
    answer =  []
    
    for i in number:
        while answer and answer[-1] < i and k > 0:
            answer.pop()
            k = k - 1
        answer.append(i)
        
    if k>0:
        while k > 0:
            answer.pop()
            k = k - 1
        
    answer = "".join(answer)
        
    return answer

 

 

 

 

참고

https://hyunsix.tistory.com/entry/%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4-%ED%81%B0%EC%88%98%EB%A7%8C%EB%93%A4%EA%B8%B0-python