LeetCode之maxProfit

int maxProfit_T(vector<int> &prices) //Best Time to Buy and Sell Stock{if(prices.size()<2) return 0;int profit=0;int cur_min=prices[0];for (int i=0;i<prices.size();i++){profit=max(prices[i]-cur_min,profit);cur_min=min(prices[i],cur_min);}return profit;}