# Process (list)
# 1. Input prices list
# 2. Iterate i from begin to the end
# 2.1. Iterate j from i to the end
# 2.1.1. Check if [j] is smaller than [i]
# 2.1.1.1. If so - it's done
# 2.1.2. Count
# 2.2. Add to answer_list
# 3. Return answer_list
# 스택을 따로 쓰진 않고 그냥 비스므리하게 구현함
def solution(prices):
answer_list = []
for i in range(0, len(prices)):
isDone = False
count = 0
j = i
while (j < len(prices) and not isDone):
count+=1
if prices[i] > prices[j]:
isDone = True
j+=1
answer_list.append(count-1)
return answer_list
2019/10/09 - [Computer/General] - 정보처리기사 실기/필기 - IT신기술동향_전산영어 요점 정리