动态规划：面试题63. 股票的最大利润

面试题63. 股票的最大利润

 

 

 

动态规划解析：

 

 

 

 

 

 

 

class Solution {
public:
    int maxProfit(vector<int>& prices) 
    {
        if (prices.size() < 2)
        {
            return 0;
        }
        int cout = prices[0];
        // int dp[prices.size()];
        // dp[0] = 0;
        int profit = 0;
        for (int i=1; i<prices.size(); i++)
        {
            cout = min(cout, prices[i]);
            profit = max(profit, prices[i]-cout);
            //dp[i] = max(dp[i-1], prices[i]-cout);
        }
        return profit;
    }
};