买卖股票的最佳时机-LintCode

#ifndef C149_H
#define C149_H
#include<iostream>
#include<vector>
using namespace std;
class Solution {
public:
/**
* @param prices: Given an integer array
* @return: Maximum profit
*/
int maxProfit(vector<int> &prices) {
// write your code here
int len = prices.size();
if (len <= 0)
return 0;
vector<int> dp(len);
int count = INT_MIN;
for (int i = 1; i < len; ++i)
{
if (dp[i - 1] >= 0)
dp[i] = dp[i - 1] + prices[i] - prices[i - 1];
else
dp[i] = prices[i] - prices[i - 1];
count = dp[i]>count ? dp[i] : count;
}
return count>0?count:0;
}
};
#endif