Best Time to Buy and Sell Stock III

Paul_ZJ

于 2015-01-29 10:37:04 发布

阅读量370

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode——坚持每天一题

本文链接：https://blog.youkuaiyun.com/shuitawuhen/article/details/43267725

LeetCode——坚持每天一题专栏收录该内容

176 篇文章

订阅专栏

本文介绍了一种算法，用于计算给定股票价格数组中通过至多两次交易获得的最大利润。该算法分为两个阶段：首先计算第一次交易的最大利润，然后计算第二次交易的最大利润，并最终将两次利润相加得到总的最大利润。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Best Time to Buy and Sell Stock III

Say you have an array for which the ith element is the price of a given stock on day i.

Design an algorithm to find the maximum profit. You may complete at most two transactions.

Note:
You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).
java代码：

public class Solution {
    public int maxProfit(int[] prices) {
        int n = prices.length;
    if(n<2) return 0;

    //first transaction's max profit
    int[] fmp = new int[n];
    fmp[0] = 0;
    int minPrice = prices[0];
    for(int i=1; i<n; i++){
        minPrice = Math.min(minPrice, prices[i]);
        fmp[i] = Math.max(fmp[i-1], prices[i]-minPrice);
    }

    //second transaction's max profit
    int[] smp = new int[n];
    smp[n-1] = 0;
    int maxPrice = prices[n-1];
    for(int i=n-2; i>=0; i--){
        maxPrice = Math.max(maxPrice, prices[i]);
        smp[i] = Math.max(smp[i+1], maxPrice-prices[i]);
    }

    int profix = 0;
    for(int i=0; i<n; i++){
        profix = Math.max(profix, fmp[i]+smp[i]);
    }

    return profix;
    }
}