122. Best Time to Buy and Sell Stock II

最新推荐文章于 2024-01-03 12:56:44 发布

原创最新推荐文章于 2024-01-03 12:56:44 发布 · 255 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#java leetcode

leetcode 专栏收录该内容

18 篇文章

订阅专栏

本文介绍了一种用于计算股票交易中最大利润的算法。该算法允许进行多次买卖操作，但不能同时持有多个仓位。通过一次遍历价格数组，并采用贪心策略，在每次价格上涨时累积利润，从而得出最大可能收益。

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

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 as many transactions as you like (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

Subscribe to see which companies asked this question.

此题很121的题相似，不过这道题求的是可以多次买多次卖的利润最大化。可以从头到尾扫描，如果price[i] – price[i-1]

那么，计入total。贪心法。

 public int maxProfit1(int[] prices) {
    	int total = 0;
        for (int i=0; i< prices.length-1; i++) {
            if (prices[i+1]>prices[i]) total += prices[i+1]-prices[i];
        }
        return total;
    }