LeetCode剑指 Offer 63. 股票的最大利润

class Solution {
public:

    int maxFun(int a, int b)
    {
        return a > b ? a : b;
    }
    
    int minFun(int a, int b)
    {
        return a < b ? a : b;
    }

    int maxProfit(vector<int>& prices) {

        if (!prices.size())
        {
            return 0;
        }

        int max = 0, min = prices[0];
        for (int i = 1;i < prices.size();i++)
        {
            max = maxFun(max, prices[i] - min);
            min = minFun(min, prices[i]);
        }
        return max;
    }
};