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

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