LeetCode 739. Daily Temperatures

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

方法和sliding window maximum一模一样，就是保持treeset里的递减数列。

    public int[] dailyTemperatures(int[] T) {
        int[] res = new int[T.length];
        TreeSet<Integer> set = new TreeSet<>((o1, o2) -> (T[o1] == T[o2] ? o1 - o2 : T[o2] - T[o1]));
        set.add(T.length - 1);
        for (int i = T.length - 2; i >= 0; i--) {
            while (!set.isEmpty() && T[i] >= T[set.last()]) {
                set.pollLast();
            }
            if (set.size() == 0) res[i] = 0;
            else {
                res[i] = set.last() - i;
            }
            set.add(i);
        }
        return res;
    }