LeetCode – Refresh – Best Time to Buy and Sell Stock

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        if (prices.size() < 2) return 0;
        int len = prices.size(), result = 0, rec = prices[0];
        for (int i = 1; i < len; i++) {
            result = max(result, prices[i] - rec);
            rec = min(rec, prices[i]);
        }
        return result;
    }
};