码迷,mamicode.com
首页 > 其他好文 > 详细

Best Time to Buy and Sell Stock II

时间:2014-07-09 23:32:44      阅读:276      评论:0      收藏:0      [点我收藏+]

标签:des   cti   for   io   算法   amp   

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

 

这样就可以在每次上升子序列之前买入,在上升子序列结束的时候卖出。相当于能够获得所有的上升子序列的收益。
而且,对于一个上升子序列,比如:5,1,2,3,4,0 中的1,2,3,4序列来说,对于两种操作方案:
一,在1买入,4卖出;
二,在1买入,2卖出同时买入,3卖出同时买入,4卖出;
这两种操作下,收益是一样的。


所以算法就是:从头到尾扫描prices,如果i比i-1大,那么price[i] – price[i-1]就可以计入最后的收益中。这样扫描一次O(n)就可以获得最大收益了。

 

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

Best Time to Buy and Sell Stock II,布布扣,bubuko.com

Best Time to Buy and Sell Stock II

标签:des   cti   for   io   算法   amp   

原文地址:http://www.cnblogs.com/hicandyman/p/3829673.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!