LeetCode 121. 买卖股票的最佳时机

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int min = INT_MAX, max = 0;   //int最大数是INT_MAX
        int n = prices.size();
        for(int i = 0; i < n; ++i){
            if(prices[i] < min){
                min = prices[i];    //保存历史最低点
                
            }else if(max < prices[i] - min){
                max = prices[i] - min;
            }
        }
        return max;
    }
};