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

class Solution {
public:
    /**
     * 
     * @param prices int整型vector 
     * @return int整型
     */
    int maxProfit(vector<int>& prices) {
        int i=0,j=0,m=0;
        while(i<prices.size())
        {
            if(prices[i]>prices[j])
                m=max(m,prices[i]-prices[j]);
            else if(prices[i]<=prices[j])
                j=i;
            i++;
        }
        return m;
    }
};

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