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.
Input: prices = [1, 3, 2, 8, 4, 9], fee = 2
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.