int ret = 0; if(prices.size()<2) return ret; int lowest = prices[0]; for(int i=1;i<prices.size();i++) { int cur = prices[i]; ret = max(ret,cur-lowest); lowest = min(lowest,cur); } return ret; }};
转载于:https://www.cnblogs.com/huxiangang/p/6522784.html
