[leetcode] Best Time to Buy and Sell Stock II

最新推荐文章于 2025-08-09 11:46:48 发布

转载最新推荐文章于 2025-08-09 11:46:48 发布 · 44 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/lasclocker/p/4997335.html

文章标签：

#数据结构与算法

本文介绍了一种算法，用于计算给定股票价格序列时能够获得的最大利润。该算法允许进行多次买卖交易，但每次必须先卖出才能再次购买。通过遍历价格数组并更新最小购买价格和最大利润来实现。

摘要生成于 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).

分析：同题目 Best Time to Buy and Sell Stock ，这些只要注意叠加每一小段的收益

代码：

    public int maxProfit(int[] prices) {
        if(prices == null || prices.length == 0)
            return 0;
        int min = prices[0], max = prices[0];
        int result = 0;
        for (int i = 1; i < prices.length; i++) {
            if (prices[i] > max) { // 叠加每一小段的收益
                max = prices[i];
                result += max - min;
                min = prices[i];
            } else if (prices[i] < min) { // 重新规定查找区域
                min = prices[i];
                max = prices[i];
            }
        }
        return result;
    }