LeetCode(122) Best Time to Buy and Sell Stock II

最新推荐文章于 2022-07-29 20:36:59 发布

kiey_

最新推荐文章于 2022-07-29 20:36:59 发布

阅读量196

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/cokkiey/article/details/52975273

本文介绍了一种用于计算股票交易中最大利润的高效算法。该算法允许进行多次买入和卖出操作，但每次卖出后才能再次买入。通过寻找价格序列中的局部最小值和局部最大值来确定买入和卖出时机，实现总利润最大化。

题目：

可以买卖任意多次，求利润最大值。

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).

解法：

下降到最低点买入，上升到最高点卖出。复杂度O(n)。

代码：

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int i=0,n=prices.size();
        int minn,maxx,res=0;
        while(i<n-1)
        {
            while((i<n-1)&&prices[i]>prices[i+1]) i++;
            minn=prices[i];
            if(i==n-1) break;
            i++;
            while((i<n-1)&&prices[i]<prices[i+1]) i++;
            maxx=prices[i];
            res+=maxx-minn;
        }
        return res;
    }
};