LeetCode NO.121 cpp（2.3）

标签：数组、动态规划

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