力扣买卖股票的最佳时机(c++实现)

class Solution {
public:
    int maxProfit(vector& prices) {
        int res=0;
        int minPrice = 2e9;
        for(auto price:prices){
            minPrice = min(minPrice,price);
            res =max(res,price - minPrice);
        }
        return res;
    }

};

你可能感兴趣的:(算法,leetcode,c++,算法)