Best Time to Buy and Sell Stock II
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 max = 0;
int start = prices[0];
int last = prices[0];
int sz = prices.size();
for(vector<int>::size_type st = 1; st < sz; st ++)
{
if(prices[st] >= last)
{
last = prices[st];
if(st == sz-1)// end
max += (last-start);
}
else
{
max += (last-start);
start = prices[st];
last = prices[st];
}
}
return max;
}
};
【LeetCode】Best Time to Buy and Sell Stock II,布布扣,bubuko.com