LeetCode – Refresh – Best Time to Buy and Sell Stock

 1 class Solution {
 2 public:
 3     int maxProfit(vector<int> &prices) {
 4         if (prices.size() < 2) return 0;
 5         int len = prices.size(), result = 0, rec = prices[0];
 6         for (int i = 1; i < len; i++) {
 7             result = max(result, prices[i] - rec);
 8             rec = min(rec, prices[i]);
 9         }
10         return result;
11     }
12 };