def solution(numbers, k):
biggest_num = []
removed = k
for number in numbers:
while biggest_num and biggest_num[-1] < number and removed > 0:
biggest_num.pop()
removed -= 1
biggest_num.append(number)
answer_length = len(numbers) - k
if len(biggest_num) > answer_length:
biggest_num = biggest_num[:answer_length]
return "".join(biggest_num)
print(solution("1924", 2))
print(solution("9412", 2))
print(solution("1231234", 3))
print(solution("4177252841", 4))
'알고리즘 > 프로그래머스' 카테고리의 다른 글
[프로그래머스] 단어변환 (python) (0) | 2021.06.27 |
---|---|
[프로그래머스] 오픈채팅방 (python) (0) | 2021.06.26 |
[프로그래머스] H-Index (python) (0) | 2021.06.23 |
[프로그래머스] 위장(python) (0) | 2021.06.22 |
[프로그래머스] 전화번호 목록(python) (0) | 2021.06.21 |
댓글