[leetcode] Best Time to Buy and Sell Stock II

股票买卖算法

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

原创最新推荐文章于 2023-02-28 14:37:52 发布 · 364 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

171 篇文章

订阅专栏

本文介绍了一种股票交易算法，该算法可以在不限制交易次数的前提下找到最大化的利润。通过遍历股票价格数组并累加每次价格上涨所带来的利润，实现了最优解。

题目：

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) {
		if (prices.empty()) return 0;
		int res = 0;
		for (int i = 1; i < prices.size(); ++i){
			if (prices[i] > prices[i - 1]) res += prices[i] - prices[i - 1];
		}
		return res;
	}
};