股票的最大收益（有交易费）

为什么80%的码农都做不了架构师？>>>   

Best Time to Buy and Sell Stock with Transaction Fee

问题：

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.

解决：

①  动态规划，

buy[i] 表示第i天的买收益的最大，sell[i] 表示第i天的卖收益的最大；

初始化：buy[0] = - prices[0] ( 我们买了第一件），sell[0] = 0 （没法卖，没有收益）

状态转移：

buy[i] = max( sell[i-1] - prices[i], buy[i-1]); 
( 前一天卖了后今天买了， 前一天的最大）

sell[i] = max( buy[i-1] + prices[i] - fee , sell[i-1]);

class Solution { //20ms
    public int maxProfit(int[] prices, int fee){
        int len = prices.length;
        if (len <= 1) return 0;
        int[] buy = new int[len];
        int[] sell = new int[len];
        buy[0] = - prices[0];
        sell[0] = 0;
        for (int i = 1;i < prices.length;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];
    }
}

② 可以简化为两个变量。

class Solution { //16ms
    public int maxProfit(int[] prices, int fee){
        int sell = 0;
        int buy = -prices[0];
        for (int i = 1;i < prices.length;i ++){
            sell = Math.max(sell,buy + prices[i] - fee);
            buy = Math.max(buy,sell - prices[i]);
        }
        return sell;
    }
}

转载于:https://my.oschina.net/liyurong/blog/1607626