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

贪心

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