problem
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).
具体详见Leetcode
Analysis
这道题的初始版本,买卖一次的做法在之前的博客中有提到,具体详见my博客。
而这题与上题不同的是,在一次买入一次卖出的前提下,允许多次交易。所以我们要在不确定交易次数的前提下,尽可能地保证收益最大。
一种方法是,找到所有的极大值和最小值,然后把每一对极大值与极小值的差加入到总的profit中去。因为我们不可能在除极小值之外的值买入,因为极小值总会比他们更小,以更低的价格买入会让利益更高,所以一定要在极小值买入。同样的,在极大值附近不能找到一个值比它更大,我们要保证以一种极高的价格卖出。假设有极小值min1,极大值max1,极小值min2,极大值max2,在我们的算法下,利益是(max1-min1)+(max2-min2),而假设min2>min1,max2>max1,直接用max2-min1的话,可以发现max2-min1=max2-max1+max1-min1
Complexity
时间复杂度:
O(n)
空间复杂度:
O(1)
Code
class Solution {
public:
int maxProfit(vector<int>& prices) {
int sum=0;
for (int i = 1; i < prices.size(); i++) {
sum += (prices[i]>prices[i-1]) ? (prices[i]-prices[i-1]) : 0;
}
return sum;
}
};