[LeetCode] 122. Best Time to Buy and Sell Stock II (Python)

• 단순하게 current와 next를 비교해서 그 차이를 계속 더해주는 로직

Solution

from typing import List


class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        answer = 0

        for i in range(len(prices) - 1):
            current, next = prices[i], prices[i + 1]
            if current < next:
                answer += next - current

        return answer

Reference

• https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii