Best Time to Buy and Sell Stock（C++股票的最大利润）

（1）贪心

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int n=prices.size();
        if(n<=1) return 0;
        
        int mins=prices[0],maxs=0;
        for(int i=1;i<n;i++) {
            if(prices[i]>=mins) maxs=max(maxs,prices[i]-mins);
            else mins=prices[i];
        }
        return maxs;
    }
};