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

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