739. Daily Temperatures
题目描述:Given a list of daily
temperatures
, produce a list 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, put0
instead.For example, given the list
temperatures = [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]
.题目大意:给定一个温度数组,找出下一个上升温度需要的天数,如果没有相应的温度则返回0
思路:栈
代码
package HashTable; import java.util.Stack; /** * @author OovEver * 2018/1/10 0:03 */ public class LeetCode739 { public static int[] dailyTemperatures(int[] temperatures) { Stack<Integer> stack = new Stack<>(); int res[] = new int[temperatures.length]; for(int i=0;i<temperatures.length;i++) { while (!stack.isEmpty() && temperatures[i] > temperatures[stack.peek()]) { int idx = stack.pop(); res[idx] = i - idx; } stack.push(i); } return res; } }