leetpycode/medium/best_time_to_buy_and_sell_stock_ii.py

13 lines
371 B
Python

# https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii
from typing import List
class Solution:
def maxProfit(self, prices: List[int]) -> int:
result = 0
last = prices[0]
for i in range(1, len(prices)):
if last < prices[i]:
result += prices[i] - last
last = prices[i]
return result