leetcode_best_time_to_buy_and_sell_stock_ii

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        if(prices.size()==0) return 0;
        int max_profit = 0;
        int min_price = prices.front(), max_price = prices.front();
        for(auto it = prices.begin(); it != prices.end(); it++)
        {
            if(*it > max_price)
            {
                max_price = *it;
                max_profit = max(max_price-min_price, max_profit);
            }
            if(*it < min_price)
            {
                min_price = *it;
                max_price = *it;
            }
        }
        return max_profit;
    }
};