LeetCode121. 买卖股票的最佳时机

//121
class Solution {
public:
  int maxProfit(vector<int>& s) {
    int n = s.size();
    if (n <= 1) return 0;
    vector<int> maxi(n, 0);
    maxi[n - 1] = s[n - 1];
    for (int i = n - 2; i >= 0; i--)
      maxi[i] = max(maxi[i + 1], s[i]);
    int ans = 0;
    for (int i = 0; i < n; i++) 
      ans = max(ans, maxi[i] - s[i]);
    return ans;
  }
};