739. Daily Temperatures -M

Given a list of daily temperatures T, return a list such that, for each day in the input, tells you how many days you would have to wait until a warmer temperature. If there is no future day for which this is possible, put 0 instead.

For example, given the list of temperatures T = [73, 74, 75, 71, 69, 72, 76, 73], your output should be [1, 1, 4, 2, 1, 1, 0, 0].

Note: The length of temperatures will be in the range [1, 30000]. Each temperature will be an integer in the range [30, 100].

A:

就是一个数组，找到其后比他高的数字里最近的那个。
思路是：保持一个increasing list, 然后每次

class Solution {
public:
    vector<int> dailyTemperatures(vector<int>& temperatures) {
        int n = temperatures.size();
        vector<int> res(n, 0);
        stack<pair<int, int>> S; // <temperature, index>
        S.push({temperatures[n - 1], n - 1});
        for (int i = temperatures.size() - 1; i >= 0; i--) {
            int val = temperatures[i];
            while (!S.empty() && S.top().first <= temperatures[i]) {
                S.pop();
            }
            if (!S.empty()) {
                res[i] = S.top().second - i;
            }
            S.push( {temperatures[i], i});
        }
        return res;
    }
};

Error:

    忘了是距离， 因此需要 - i