GoLang Solution For LeetCode Problem: Best Time to Buy and Sell Stock with Transaction Fee
You may complete as many transactions as you like, but you need to pay the transaction fee for each transaction. You may not buy more than 1 share of a stock at a time (ie. you must sell the stock share before you buy again.)
Return the maximum profit you can make.
Input: prices = [1, 3, 2, 8, 4, 9], fee = 2 Output: 8 Explanation: The maximum profit can be achieved by: Buying at prices = 1 Selling at prices = 8 Buying at prices = 4 Selling at prices = 9 The total profit is ((8 - 1) - 2) + ((9 - 4) - 2) = 8.
0 < prices.length <= 50000.
0 < prices[i] < 50000.
0 <= fee < 50000.
See the full details of the problem Best Time to Buy and Sell Stock with Transaction Fee at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go