leetcode之Best Time to Buy and Sell Stock II

最新推荐文章于 2022-07-29 20:36:59 发布

原创最新推荐文章于 2022-07-29 20:36:59 发布 · 424 阅读

0 ·

CC 4.0 BY-SA版权

leetcode刷题记录专栏收录该内容

16 篇文章

订阅专栏

本文介绍了一种用于计算股票交易中最大利润的算法。该算法允许进行多次买卖操作但不能同时持有多个仓位。通过逐个检查价格变化并寻找最佳买入卖出时机来最大化利润。

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

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).

源代码如下：

public class Solution {
    public int maxProfit(int[] prices) {
        if(prices == null || prices.length <= 1)  
            return 0; 
        int max = 0;
        int begin = 0,end = 0;
        for(int i = 1; i < prices.length; i ++){
            if(prices[end] > prices[i]){
                max += maxProfitByOneTransaction(prices, begin, end);
                begin = end + 1;
                end = end + 1;
            }else{
                end ++;
            }
        }
        if(end != begin)
            max += maxProfitByOneTransaction(prices, begin, end);
        return max;
    }
    
    public int maxProfitByOneTransaction(int[] prices, int begin, int end) {  
        if(prices == null || prices.length <= 1)  
            return 0;  
        int maxProfit = 0;  
        int maxValue = prices[begin], minValue = prices[begin];  
        for(int i = begin + 1; i <= end; i ++){  
            if(maxValue < prices[i]){  
                maxValue = prices[i];  
            }else if(minValue > prices[i]){  
                minValue = prices[i];  
                maxValue = prices[i];  
            }  
              
            if(maxProfit < maxValue - minValue){  
                maxProfit = maxValue - minValue;  
            }  
              
        }  
        return maxProfit;  
    }  
}