LEETCODE--Best Time to Buy and Sell Stock II

最新推荐文章于 2022-02-07 21:21:56 发布

原创最新推荐文章于 2022-02-07 21:21:56 发布 · 208 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

137 篇文章

订阅专栏

本文介绍了一种计算股票交易最大利润的算法。该算法允许进行多次买卖操作，但每次卖出后才能再次购买。通过遍历股价数组，可以高效地计算出最大收益。

摘要生成于 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 len = prices.size();
        int profit = 0;
        for(int i = 1; i < len; i++){
            profit += max(prices[i]-prices[i-1], 0); 
        }
        return profit;
    }
};

方法二：略麻烦

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int i = 0;
        int j = 1;
        int len = prices.size();
        int profit = 0;
        int pre;
        while(j < len){
            pre = prices[j-1];
            if(pre < prices[j]){
                j++;
                if(j == len)
                    profit += prices[j-1] - prices[i];
            }else{
                cout << pre << endl;
                profit += pre - prices[i];
                i = j;
                j++;

            }
        }
        return profit;
    }
};