⭐️
def solution(cap, n, deliveries, pickups):
answer = 0
# 먼 곳부터 배달, 수거
deliveries = deliveries[::-1]
pickups = pickups[::-1]
ps_deliveries, ps_pickups = 0, 0
for i in range(n):
# 각각의 누적합
ps_deliveries += deliveries[i]
ps_pickups += pickups[i]
# 누적합이 0 또는 음수가 될때까지 반복
while(ps_deliveries > 0 or ps_pickups > 0):
ps_deliveries -= cap
ps_pickups -= cap
answer += (n-i)*2
return answer
출처: 프로그래머스 코딩 테스트 연습, https://school.programmers.co.kr/learn/challenges