[LeetCode122]Best Time to Buy and Sell Stock II
2016-01-26 14:04
441 查看
题目:
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).
题意类似于股价,每天价格不一样,每天都可以出手或入手,求最终最大收益
思路:可以考虑动态规划,求出来前i-1天的最大收益,比较i天价格和i-1价格,如果大于则前i天最大收益为前i-1天最大收益加上这两天价格差,否则前i天最大收益和前i-1天最大收益相同。
代码:
可以简化如下:
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).
题意类似于股价,每天价格不一样,每天都可以出手或入手,求最终最大收益
思路:可以考虑动态规划,求出来前i-1天的最大收益,比较i天价格和i-1价格,如果大于则前i天最大收益为前i-1天最大收益加上这两天价格差,否则前i天最大收益和前i-1天最大收益相同。
代码:
class Solution { public: int maxProfit(vector<int>& prices) { if(prices.size() == 0) return 0; vector<int> maxProfit; maxProfit.push_back(0); for(int i = 1; i < prices.size(); ++i) { if(prices[i] <= prices[i-1]) maxProfit.push_back(maxProfit[i-1]); else { int tmp = prices[i] - prices[i-1]; maxProfit.push_back(maxProfit[i-1] + tmp); } } int max = 0; for(auto num : maxProfit) { if(max < num) max = num; } return max; } };
可以简化如下:
int maxProfit(vector<int> &prices) { int ret = 0; for (size_t p = 1; p < prices.size(); ++p) ret += max(prices[p] - prices[p - 1], 0); return ret; }
相关文章推荐
- js中创建桌面网页快捷方式代码
- Boost 学习之算法篇 is_sorted
- Android聊天实现图文混编(包括gif显示)
- 1、开篇
- hibernate4 二级缓存demo实例
- CSS 备忘
- CI框架 -- 核心文件 之 Common.php
- MySQL中优化常用的查询sql语
- iOS开发 小工具
- 对于UVa12096“集合的集合”的理解
- The Java™ Tutorials — Generics :Generic Methods 泛型方法
- 1015. 德才论 (25)
- 万用表怎么用?
- eclipse中使用git
- Oracle spool 用法小结
- 正则表达式-Java
- 其他位不变,具体位的赋值操作
- header操作cookie
- srxboys自述
- (Slor)java对solr的基本操作