股票最大利润

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;
}
};