题解 | 买卖股票的最好时机(一)

#include <climits>
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param prices int整型vector 
     * @return int整型
     */
    int maxProfit(vector<int>& prices) {
        // write code here
        if (prices.empty()||prices.size() == 1)    return 0;
        
        int n = prices.size();
        int in_price = prices[0];
        int fee = INT_MIN;
        for(int i=1;i<n;i++){
            if(prices[i]>in_price){
                fee = prices[i]-in_price>fee?prices[i]-in_price:fee;
            }else {
                in_price = prices[i];
            }
        }
        return fee>INT_MIN?fee:0;
    }
};