#121

Best Time to Buy and Sell Stock

pupil · 395 · lc easy +24 · verified · 56.5% accepted · 35,441 likes · top 51%

⚑ Kadane's / Maximum Subarray ⚑ Stock Trading / State Machine DP ⚑ Running Min/Max Tracking

Description

An array prices is given where prices[i] is the stock price on day i.

Choose a single day to buy and a later day to sell to maximize your profit.

Return the maximum achievable profit, or 0 if no profitable transaction is possible.

Example 1:

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

Output: 5

Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5.

Note that buying on day 2 and selling on day 1 is not allowed because you must buy before you sell.

Example 2:

Input: prices = [7,6,4,3,1]

Output: 0

Explanation: In this case, no transactions are done and the max profit = 0.

Code

1

2

3

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

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