LeetCode-Daily Temperatures

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

题意：给定一个数组T表示每天的温度，现在要求计算对于当天来说，要等待多少天，才可以有一个比现在温度更高的，如果没有，则结果为0；

解法：最简单的解决办法就是遍历数组T，对于每一个元素，从当前位置向后找到第一个比其大的元素，两个元素的下标差即是最后的结果（如果没有找到比其大的元素，结果为0）；

Java

class Solution {
    public int[] dailyTemperatures(int[] T) {
        int[] result = new int[T.length];
        for (int i = 0; i < T.length; i++) {
            int j = i + 1;
            while (j < T.length && T[j] <= T[i]) j++;
            result[i] = j == T.length ? 0 : j - i;
        }
        return result;
    }
}