1.题目
2.解法
维护最小的买入值与最大的收益。
class Solution {
public:
int maxProfit(vector<int>& prices) {
if (prices.size() == 0) return 0;
int res = 0, minprice = prices[0];
for (int i=1; i<prices.size(); i++) {
if (minprice > prices[i]) {
minprice = prices[i];
} else if (res < prices[i] - minprice) {
res = prices[i] - minprice;
}
}
return res;
}
};