Best Time to Buy and Sell Stock II

最新推荐文章于 2022-11-16 09:46:40 发布

coobj2008

最新推荐文章于 2022-11-16 09:46:40 发布

阅读量389

点赞数

CC 4.0 BY-SA版权

分类专栏：面试题

本文链接：https://blog.youkuaiyun.com/coobj2008/article/details/21517917

面试题专栏收录该内容

144 篇文章

订阅专栏

本文介绍了一种在股票市场中实现最大利润的算法。通过在价格最低点买入并在价格最高点卖出，实现多次交易以累积利润。算法设计考虑了买卖时机的选择，确保在不同时段进行有效的交易。

摘要生成于 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 sum = 0;
    	int j = 0;
    	int n = prices.size();
    	while(j < n) {
    		while(j+1 < n && prices[j] >= prices[j+1])
    			j++;
    		if(j < n-1) {
    			sum -= prices[j];
    			j++;
    			while(j+1 < n && prices[j] <= prices[j+1])
    				j++;
    			sum += prices[j];
    		}
    		j++;
    	}
    	return sum;        
    }
};