LeetCode: Best Time to Buy and Sell Stock II

最新推荐文章于 2020-04-12 22:35:46 发布

原创最新推荐文章于 2020-04-12 22:35:46 发布 · 336 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

186 篇文章

订阅专栏

本文介绍了一种算法，用于计算给定股票价格序列时能够获得的最大利润。该算法允许进行多次买卖交易，但每次交易必须在下一次购买之前完成卖出。通过两个不同实现展示了如何动态调整买入价格并累计利润。

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

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        int min = INT_MAX, profit = 0, total = 0;;
        int size = prices.size();
        for(int i = 0; i < size; i++)
        {
            if(prices[i] < min){
                min = prices[i];
            }
            if(prices[i] - min > profit){
                profit = prices[i] - min;
            }
            if(i == size - 1 || prices[i+1] < prices[i])
            {
                total += profit;
                profit = 0;
                min = INT_MAX;
            }
        }
        return total;
        
    }
};

Round 2:

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        int min = INT_MAX;
        int preMax = 0;
        int result = 0;
        for(int i = 0; i < prices.size(); i++)
        {
            if(prices[i] < min)
                min = prices[i];
            if(prices[i] - min > preMax)
                preMax = prices[i]-min;
            else
            {
                if(preMax != 0)
                {
                    result += preMax;
                    min = INT_MAX;
                    preMax = 0;
                    i--;
                }
            }
        }
        result += preMax;
        return result;
    }
};