GoLang Solution For LeetCode Problem: Best Time to Buy and Sell Stock with Cooldown
Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times) with the following restrictions:
- You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).
- After you sell your stock, you cannot buy stock on next day. (ie, cooldown 1 day)
Input: [1,2,3,0,2] Output: 3 Explanation: transactions = [buy, sell, cooldown, buy, sell]
See the full details of the problem Best Time to Buy and Sell Stock with Cooldown at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go