Leetcode 贪心 Best Time to Buy and Sell StockII

最新推荐文章于 2024-10-12 21:27:23 发布

zhsenl

最新推荐文章于 2024-10-12 21:27:23 发布

阅读量743

点赞数

分类专栏： leetcode leetcode算法详解

本文链接：https://blog.csdn.net/zhengsenlie/article/details/25643343

版权

leetcode 同时被 3 个专栏收录

100 篇文章 0 订阅

订阅专栏

leetcode算法详解

83 篇文章 4 订阅

订阅专栏

算法

64 篇文章 0 订阅

订阅专栏

本文为senlie原创，转载请保留此地址：http://blog.csdn.net/zhengsenlie

Best Time to Buy and Sell Stock II

Total Accepted: 13030 Total Submissions: 36467

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)，空间O(1)

相关题目：

Best Time to Buy and Sell Stock

Best Time to Buy and Sell StockIII

class Solution {
public:
	int maxProfit(vector<int> &prices) {
		if (prices.size() < 2) return 0;
		int sum = 0;
		for(int i = 1; i < prices.size(); i++){
			int diff = prices[i] - prices[i - 1];
			sum += diff > 0 ? diff : 0;
		}
		return sum;
	}
};