[LeetCode] Best Time to Buy and Sell Stock II 贪心算法

最新推荐文章于 2025-08-15 16:44:13 发布

weixin_33682719

最新推荐文章于 2025-08-15 16:44:13 发布

阅读量82

点赞数

CC 4.0 BY-SA版权

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/Azhu/p/4333319.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).

Hide Tags

Array Greedy

#include <iostream>
#include <vector>
using namespace std;

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        int n=prices.size();
        if(n<2) return 0;
        int sum=0;
        for(int i =1;i<n;i++){
            if(prices[i]>prices[i-1]){
            sum += prices[i] - prices[i-1];
            }
        }
        return sum;
    }
};

int main()
{
    vector<int > prices{1,3,2,4,7};
    Solution sol;
    cout<<sol.maxProfit(prices)<<endl;
    return 0;
}