714. Best Time to Buy and Sell Stock with Transaction Fee

https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/description/

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.

解题思路：
对于第i天共有两种情况买或者卖或者什么都不做
状态转移方程：
第i天买收益最大,第i-1天买了收益最大或者第i-1天卖了的收益
buy[i] = max(buy[i-1],sell[i-1]-prices[i])
第i天卖收益最大,第i-1天卖了收益最大或者第i-1天买了的收益
sell[i] = max(sell[i-1],buy[i-1]+prices[i]-fee)
边界条件：

buy[0]=-price[0]
sell[0]=0;

public class Best_Time_to_Buy_and_Sell_Stock_with_Transaction_Fee_714 {

    /**
     * 
     * 对于第i天共有两种情况买或者卖或者什么都不做
     * 最优子结构和状态转移方程
     * 第i天买收益最大,第i-1天买了收益最大或者第i-1天卖了的收益
     *  buy[i] = max(buy[i-1],sell[i-1]-prices[i])
     * 第i天卖收益最大,第i-1天卖了收益最大或者第i-1天买了的收益
     * sell[i] = max(sell[i-1],buy[i-1]+prices[i]-fee)
     * 边界条件
     * buy[0]=-price[0]
     * sell[0]=0;
     * @param prices
     * @param fee
     * @return
     */
    public int maxProfit(int[] prices, int fee) {
        int n = prices.length;
        int[] buy = new int[n+1];
        int[] sell = new int[n+1];
        buy[0] = -prices[0];
        sell[0] = 0;
        for(int i=1;i<n;i++){
            buy[i] = Math.max(buy[i-1],sell[i-1]-prices[i]);
            sell[i] = Math.max(sell[i-1],buy[i-1]+prices[i]-fee);
        }
        return sell[n-1];
    }

    public static void main(String[] args) {
        int[] inputArr = {1, 3, 2, 8, 4, 9};
        int fee = 2;
        System.out.println(new Best_Time_to_Buy_and_Sell_Stock_with_Transaction_Fee_714().maxProfit(inputArr, fee));
    }

}