LeetCode *** 122. Best Time to Buy and Sell Stock II

原创于 2016-04-12 08:55:52 发布 · 272 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

212 篇文章

订阅专栏

本文介绍了一种算法，用于计算给定股票价格序列时能够获得的最大利润。该算法允许进行多次买卖操作，但每次卖出后才能再次购买。通过遍历价格数组并跟踪当前利润和总利润来实现。

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

题目：

Say you have an array for which the i^th 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).

分析：

一连串的数字只能在卖出之后才能买入。只需要考虑当前的利润是最高的即可。

代码：

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        
        int size=prices.size();
        if(size<1)return 0;
        
        int totalpro=0,curpro=0,prestock=INT_MAX;
        
        for(int i=0;i<size;++i){
            if(prices[i]<prestock){
                totalpro+=curpro;
                curpro=0;
            }else curpro=prices[i]-prestock+curpro;
            prestock=prices[i];
        }
        totalpro+=curpro;
        return totalpro;
    }
};