- class Solution {
- public:
-
- int maxProfit(vector<int> &prices) {
-
-
if(prices.size()<2)
return a;
int lowest = prices[0];
for(int n=1;n<prices.size();n++)
{
int cur = prices[n];
a = max(a,a-lowest);
lowest = min(lowest,a);
}
return a;
}
};
买卖股票的最佳时机
原文:http://www.cnblogs.com/zhaolinjie/p/6523060.html