【Lintcode】1000. Best Time to Buy and Sell Stock with Transaction Fee

题目地址：

https://www.lintcode.com/problem/best-time-to-buy-and-sell-stock-with-transaction-fee/description

以数组$A$的形式给出每天的股票价格，只有买入之后才能卖出，并且每次卖出的时候会收取一笔交易费。问能得到的最大利润。

参考https://blog.csdn.net/qq_46105170/article/details/108764571。代码如下（这个代码是cash角度考虑的）：

public class Solution {
    /**
     * @param prices: a list of integers
     * @param fee:    a integer
     * @return: return a integer
     */
    public int maxProfit(int[] prices, int fee) {
        // write your code here
        int len = prices.length;
        int[] buy = new int[len], sell = new int[len];
        buy[0] = -prices[0];
        for (int i = 1; i < len; 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[len - 1];
    }
}

时空复杂度$O(n)$。

滚动数组优化：

public class Solution {
    /**
     * @param prices: a list of integers
     * @param fee:    a integer
     * @return: return a integer
     */
    public int maxProfit(int[] prices, int fee) {
        // write your code here
        int len = prices.length;
        int[] buy = new int[2], sell = new int[2];
        buy[0] = -prices[0];
        for (int i = 1; i < len; i++) {
            buy[i & 1] = Math.max(buy[i - 1 & 1], sell[i - 1 & 1] - prices[i]);
            sell[i & 1] = Math.max(sell[i - 1 & 1], buy[i - 1 & 1] + prices[i] - fee);
        }
        
        return sell[len - 1 & 1];
    }
}

时间复杂度不变，空间$O(1)$。