Algorithm/프로그래머스_생각정리
-
프로그래머스 택배상자(python)Algorithm/프로그래머스_생각정리 2022. 10. 18. 17:33
from collections import deque def solution(order): data = deque([i for i in range(1,len(order)+1)]) sub_data = deque() answer = 0 o = 0 flag = 0 s_flag = 0 while True: if data: if order[o] > data[0]: sub_data.appendleft(data.popleft()) elif order[o] == data[0]: data.popleft() answer +=1 o += 1 else: flag = 1 pass else: if order[o] == sub_data[0]: answer += 1 sub_data.popleft() o += 1 if o > len(..