Search

Best Time to Buy and Sell Stock with Cooldown

Updated: Mar 24, 2021

You are given an array prices where prices[i] is the price of a given stock on the ith day.

Find the maximum profit you can achieve. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multiple times) with the following restrictions:

  • After you sell your stock, you cannot buy stock on the next day (i.e., cooldown one day).

Note: You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).


Example 1:

Input: prices = [1,2,3,0,2]
Output: 3
Explanation: transactions = [buy, sell, cooldown, buy, sell]

Example 2:

Input: prices = [1]
Output: 0

Constraints:

  • 1 <= prices.length <= 5000

  • 0 <= prices[i] <= 1000

Solution:


class Solution {
    public int maxProfit(int[] prices) 
    {
        int havingstockprevday,nothavingstockprevday;
        int havingstock,nothavingstock;
        havingstock = -prices[0];
        havingstockprevday = -prices[0];
        nothavingstock =0;
        nothavingstockprevday=0;
        
        for(int i=1;i<prices.length;i++)
        {
            havingstockprevday = havingstock;
            havingstock = Math.max(havingstock,nothavingstockprevday-prices[i]);
            nothavingstockprevday = nothavingstock;
            nothavingstock = Math.max(nothavingstock,havingstockprevday+prices[i]);
        }
        return nothavingstock;
    }
}



13 views0 comments

Recent Posts

See All

A string s is called good if there are no two different characters in s that have the same frequency. Given a string s, return the minimum number of characters you need to delete to make s good. The f

The numeric value of a lowercase character is defined as its position (1-indexed) in the alphabet, so the numeric value of a is 1, the numeric value of b is 2, the numeric value of c is 3, and so on.