LeetCode //C - 309. Best Time to Buy and Sell Stock with Cooldown

309. Best Time to Buy and Sell Stock with Cooldown

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

From: LeetCode
Link: 309. Best Time to Buy and Sell Stock with Cooldown

---

Solution:

Ideas:

• hold: Represents the state where you hold a stock. Initially, you buy on the first day, hence hold[0] = -prices[0].
• sell: Represents the state where you have just sold a stock. Initially, you cannot sell on the first day, hence sell[0] = 0.
• rest: Represents the state where you neither hold nor sell a stock, essentially you are in a rest/cooldown period.

Code:

int maxProfit(int* prices, int pricesSize) {
    if (pricesSize == 0) return 0;
    
    int *hold = (int *)malloc(pricesSize * sizeof(int));
    int *sell = (int *)malloc(pricesSize * sizeof(int));
    int *rest = (int *)malloc(pricesSize * sizeof(int));
    
    hold[0] = -prices[0];  // Buy on the first day
    sell[0] = 0;           // Cannot sell on the first day
    rest[0] = 0;           // Resting on the first day

    for (int i = 1; i < pricesSize; i++) {
        hold[i] = (hold[i-1] > rest[i-1] - prices[i]) ? hold[i-1] : (rest[i-1] - prices[i]);
        sell[i] = hold[i-1] + prices[i];
        rest[i] = (rest[i-1] > sell[i-1]) ? rest[i-1] : sell[i-1];
    }

    int maxProfit = (sell[pricesSize-1] > rest[pricesSize-1]) ? sell[pricesSize-1] : rest[pricesSize-1];

    free(hold);
    free(sell);
    free(rest);

    return maxProfit;
}