【LeetCode】122. Best Time to Buy and Sell Stock II

最新推荐文章于 2017-01-14 23:28:37 发布

Juxin_Lin

最新推荐文章于 2017-01-14 23:28:37 发布

阅读量318

点赞数

分类专栏： leetcode 贪心文章标签： leetcode

本文链接：https://blog.csdn.net/Juxin_Lin/article/details/54427464

版权

leetcode 同时被 2 个专栏收录

39 篇文章 0 订阅

订阅专栏

贪心

4 篇文章 0 订阅

订阅专栏

Difficulty: Medium

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

分析

贪心法，低进高出，把所有正的价格差价相加起来

把原始价格序列变成差分序列，本题也可以做成最大m子序列和，m为数组长度

时间复杂度为O（n）

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