プログラマ株価



質問:
https://programmers.co.kr/learn/courses/30/lessons/42584
プール:
from collections import deque

#deque - 덱
# popleft() -> O(1)
# sec라는 인덱스차이로 구하기


def solution(prices):
    queue = deque(prices)
    result = []
    while queue:
        price = queue.popleft()
        sec = 0
        for q in queue:
            sec += 1
            if q < price:
                break
        result.append(sec)
    return result   
他のメンバーの新しい質問:
https://velog.io/@soo5717/%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4-%EC%A3%BC%EC%8B%9D%EA%B0%80%EA%B2%A9-Python