AlgoLounge

Best Time to Buy and Sell Stock II

medium

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. However, you can buy it then immediately sell it on the same day. Also, you are allowed to perform any number of transactions but can hold at most one share of the stock at any time.

Find and return the maximum profit you can achieve.

Examples

Example 1

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

Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5-1 = 4. Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6-3 = 3. Total profit is 4 + 3 = 7.

Example 2

Input:  prices = [1,2,3,4,5]
Output: 4

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

Constraints

  • 1 <= prices.length <= 30,000
  • 0 <= prices[i] <= 10,000
TypeScript
Loading editor…
List of test cases (12)
Case 1
prices = [7,1,5,3,6,4]
Case 2
prices = [1,2,3,4,5]
Case 3
prices = [7,6,4,3,1]
Case 4
prices = [1]
Case 5
prices = [1,2]
Case 6
prices = [2,1]
Case 7
prices = [3,3,3,3]
Case 8
prices = [1,2,1,2,1,2]
Case 9
prices = [2,4,1,0,3,2,1]
Case 10
prices = [10000,9999,9998,9997,9996]
Case 11
prices = [0,1,2,3,4,5,6,7,8,9,10000]
Case 12
prices = [5,1,3,2,6,4,8,7,9]