LeetCode Best Time to Buy and Sell Stock II

最新推荐文章于 2024-11-05 21:58:11 发布

xyzchenzd

最新推荐文章于 2024-11-05 21:58:11 发布

阅读量444

点赞数

分类专栏： LeetCode 文章标签： leetcode C++ 算法

本文链接：https://blog.csdn.net/xyzchenzd/article/details/45479381

版权

LeetCode 专栏收录该内容

125 篇文章 0 订阅

订阅专栏

题目

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

实际上就是求出所有比上一个位置价格高的点，然后和前一个价格做差，求总和。

代码：

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        int profit=0;	//最大利润
		for(int i=1;i<prices.size();i++)	//扫描利润增长点
			if(prices[i]>prices[i-1])
				profit+=prices[i]-prices[i-1];
		return profit;
    }
};