Your are given an array of integers prices, for which the i-th element is the price of a given stock on day i; and a non-negative integer fee representing a 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.
Example 1:
Input: prices = [1, 3, 2, 8, 4, 9], fee = 2
Output: 8
Explanation: The maximum profit can be achieved by:
Buying at prices[0] = 1
Selling at prices[3] = 8
Buying at prices[4] = 4
Selling at prices[5] = 9
The total profit is ((8 - 1) - 2) + ((9 - 4) - 2) = 8.
Note:
0 < prices.length <= 50000.
0 < prices[i] < 50000.
0 <= fee < 50000.
[LeetCode] Best Time to Buy and Sell Stock with Transaction Fee 買股票的最佳時間含交易費(fèi)
先記錄下參考了該博客的思路搂抒，fun4LeetCode大神的帖子做了amazing的歸納總結(jié)髓废，有時間的話博主也寫個總結(jié)私杜。這道題跟Best Time to Buy and Sell Stock II其實最像，但是由于那道題沒有交易費(fèi)的限制富弦，所以我們就無腦貪婪就可以了，見到利潤就往上加。
參考：
