121. Best Time to Buy and Sell Stock

kadane algorithmの応用で行けました

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int maxPro = INT_MIN;
        int temPro = 0;
        int minBuyPrice =INT_MAX;
        for(int i= 0; i <prices.size(); i++)
        {
            minBuyPrice = min(prices[i], minBuyPrice);
            temPro=max(temPro, prices[i]-minBuyPrice);
            if(temPro>maxPro)
            {
                maxPro= temPro;
            }
        }
        return maxPro;
    }
};