739. Daily Temperatures

Problem:

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].

思路：

Solution (C++):

vector<int> dailyTemperatures(vector<int>& T) {
    int n = T.size();
    vector<int> res(n, 0);
    for (int i = n-1; i >= 0; --i) {
        int j = i+1;
        while (j < n && T[i] >= T[j]) {
            if (res[j] > 0)  j += res[j];
            else  j = n;
        }
        if (j < n)  res[i] = j-i;
    }
    return res;
}

性能：

Runtime: 316 ms  Memory Usage: 12.7 MB

思路：

Solution (C++):

性能：

Runtime: ms  Memory Usage: MB