class Solution {
public:
int maxProfit(vector<int>& prices) {
if (prices.size() < 1)
return 0;
int min_ = prices[0];
int ret = 0;
for (int i = 1; i < prices.size(); i++)
{
ret = max(ret, prices[i] - min_);
min_ = min(min_, prices[i]);
}
return ret;
}
};
循环一次即可,每次保存当前的最小值,以及最大的差