1 2 3 4 5 6 7 8 9 10 11 12 13 | def solution(prices): answer = [] for i in range(0, len(prices)-1): # (0,3) 0,1,2 for j in range(i+1, len(prices)): # 1,4 1,2,3 if prices[i] > prices[j]: answer.append(j-i) break if j == len(prices)-1: answer.append(j-i) answer.append(0) return answer | cs |
'Programing > 자료구조, Algorithm' 카테고리의 다른 글
programmers - 더맵게[level2] - python (0) | 2019.01.26 |
---|---|
programmers - 올바른괄호[level2] - python (0) | 2019.01.26 |
programmers - 스킬트리[level2] - python (0) | 2019.01.25 |
programmers - 탑[level2] - python (0) | 2019.01.24 |
programmers - 기능개발[level2] - python (0) | 2019.01.24 |