목록프로그래머스 (31)
Try
[Programmers/Python3] 주식가격
1234567891011121314def solution(prices): answer = [] length = len(prices) for i in range(0, length): count = 0 for j in range(i, length-1): if prices[i] >prices[j]: break else: count +=1 answer.append(count) return answercs 출처https://programmers.co.kr/learn/courses/30/lessons/42584?language=python3
Algorithm/Programmers
2019. 3. 8. 19:48