-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcode17.py
More file actions
47 lines (39 loc) · 1.2 KB
/
code17.py
File metadata and controls
47 lines (39 loc) · 1.2 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
#출처: https://school.programmers.co.kr/learn/courses/30/lessons/131704
#문제: 코딩테스트 연습 >연습문제 >택배상자
def solution(order):
answer, sub = initcontainer(order)
print('answer sub', answer, sub)
for i in order[answer:]:
if i == sub[-1]:
answer += 1
sub.pop()
else:
break
return answer
def initcontainer(order):
container = [ i +1 for i in range(len(order))]
sub_container = []
result = 0
for o in order:
print('sub ', result, sub_container, o)
if len(sub_container) > 0 and o == sub_container[-1]:
result += 1
sub_container.pop()
break;
for j in container:
if o == j :
result += 1
break
else:
sub_container.append(j)
return result, sub_container
def solution(order):
stack = []
answer = 0
for idx,num in enumerate(order):
stack.append(idx +1)
while stack and stack[-1] == order[answer]:
stack.pop()
answer += 1
return answer
print(solution([5,4,3,2,1]))