leetcode Best_Time_to Buy and Sell_Stock_II

原创于 2017-05-10 23:12:30 发布 · 279 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

leetcode-c 专栏收录该内容

21 篇文章

订阅专栏

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

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


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


class Solution{
public:
     int maxProfit(vector<int>& prices){
        if(prices.size()==0)
            return 0;
        int ans=0;
        for(auto i=prices.begin()+1;i!=prices.end();++i){
            if(*i>*(i-1))       //遍历价格数组低买高卖
                ans+=*(i)-*(i-1);
        }
        return ans;
    }
};


int main()
{

        vector<int> prices = {4, 3, 4, 5, 7, 8, 9, 10, 4, 6, 3};
        Solution s;
        cout << s.maxProfit(prices) << endl;

}