[LeetCode]Best Time to Buy and Sell Stock II

最新推荐文章于 2023-02-28 14:37:52 发布

xshalk

最新推荐文章于 2023-02-28 14:37:52 发布

阅读量1k

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/xshalk/article/details/8151723

LeetCode 专栏收录该内容

27 篇文章

订阅专栏

本文介绍了一种股票交易算法的设计思路，该算法允许进行多次买卖操作以最大化利润，但必须遵循先卖后买的规则。通过分析价格波动，算法确定买入和卖出的最佳时机。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Say you have an array for which the i^th 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).

多次低买高卖，被size（）不能减一，不能倒数第一天买，这些边界弄的怪郁闷的。。。我在去google一下。

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int max = 0;	
        int i = 0;
		while(  i != prices.size())
		{
			if(i + 1 != prices.size() && prices[i+1] <= prices[i])
			{	
                i++;
				continue;
			}
		    int	j = i + 1;
			if (j != prices.size()){
				while( j + 1 !=  prices.size() && prices[j+1] >= prices[j])
				{ 
					j++;
					continue;
				}
				max = max + prices[j] - prices[i]; 
                i = j + 1;
			}
			if(j == prices.size()|| i== prices.size())
				return max ;
            
		}
		return max;
    }
};