@requires_authorization
@author johnsondu
@create_time 2015.7.19 21:01
@url [best time to buy and sell stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)
/************************
* @description: dynamic programming.
* 相邻元素做差,然后转化为最大连续子序列和
* @time_complexity: O(n)
* @space_complexity: O(n)
************************/
class Solution {
public:
int maxProfit(vector<int>& prices) {
int p_size = prices.size();
if(p_size < 2) return 0;
vector<int> dp;
for(int i = 1; i < p_size; i ++)
dp.push_back(prices[i] - prices[i-1]);
int ans = 0;
int cur = 0;
int dp_size = dp.size();
for(int i = 0; i < dp_size; i ++){
cur = cur + dp[i];
if(cur < 0) cur = 0;
if(cur > ans) ans = cur;
}
return ans;
}
};
版权声明:本文为博主原创文章,未经博主允许不得转载。
【leetcode】121. Best Time to Buy and Sell Stock
原文地址:http://blog.csdn.net/zone_programming/article/details/46958309