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

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