题解 | #买卖股票的最好时机(一)#

class Solution {
public:
    /**
     * 
     * @param prices int整型vector 
     * @return int整型
     */
    int maxProfit(vector<int>& prices) {
        // write code here
        if(prices.size()<2){
            return 0;
        }
        int minVal = prices[0],res = 0;
        for(int i=1;i<prices.size();i++) {
            minVal = min(minVal,prices[i]);
            res = max(res,prices[i]-minVal);
        }
        return res;
    }
};