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

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