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

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param prices int整型vector 
     * @return int整型
     */
    int maxProfit(vector<int>& prices) {
        // write code here
        vector<int> dp(prices.size(),0);
        int min = 10000;
        for(int i = 0;i<prices.size();i++)
        {   
            dp[i] = prices[i]>min?prices[i]-min:dp[i];
            min = prices[i]>min?min:prices[i];
        }
        int max = 0;
        for(int i =0;i<prices.size();i++)
        {
            max = max>dp[i]?max:dp[i];
        }
        return max;
    }
};