Best Time to Buy and Sell Stock II — LeetCode 122 Python Solution

The problem

You are given an integer array prices where prices[i] is the price of a given stock on the ith day. On each day, you may decide to buy and/or sell the stock.

Example

Input

prices = [7,1,5,3,6,4]

Output

7

Explanation

Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5-1 = 4.

Python solution

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        return sum(max(0, b - a) for a, b in pairwise(prices))

Complexity

Pattern: Greedy

Take the locally best option every time — when you can prove that never costs you later. LeetCode 122. Best Time to Buy and Sell Stock II is filed here because LeetCode tags it Greedy, which is the vocabulary this hub collects.

The greedy guide has the Python template for the pattern and the 346 LeetCode problems that use it.

Related problems