股票最大利润

• 给你一段时间每天股票的价格，一次买入以及卖出的机会，求你能得到的最大收益：

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int sz = prices.size();
        if(sz <= 1)
            return 0;
        int maxProfit = 0;
        int start = 0, curr = 1;
        while(curr < sz){
            if(prices[curr] < prices[start]){
                start = curr;
                curr++;
                continue;
            }
            maxProfit = max(maxProfit, prices[curr] - prices[start]);
            curr++;
        }
        return maxProfit;
    }
};