739 Daily Temperatures

739. Daily Temperatures​
1. Question
Given a list of dailytemperatures, 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, put0instead.
For example, given the listtemperatures = [73, 74, 75, 71, 69, 72, 76, 73], your output should be[1, 1, 4, 2, 1, 1, 0, 0].
Note:The length oftemperatureswill be in the range[1, 30000]. Each temperature will be an integer in the range[30, 100].
2. Implementation
(1) Monotone Stack
1
class Solution {
2
    public int[] dailyTemperatures(int[] temperatures) {
3
        int n = temperatures.length;
4
        int[] res = new int[n];
5
        Stack<Integer> stack = new Stack<>();
6
​
7
        for (int i = 0; i < n; i++) {
8
            int curTemp = temperatures[i];
9
​
10
            while (!stack.isEmpty() && curTemp > temperatures[stack.peek()]) {
11
                res[stack.peek()] = i - stack.peek();
12
                stack.pop();
13
            }
14
            stack.push(i);
15
        }
16
        return res;
17
    }
18
}
Copied!
3. Time & Space Complexity
Monotone Stack: 时间复杂度O(n), 空间复杂度O(n)

735 Asteroid Collision

770 Basic Calculator IV

Last modified 2yr ago

Copy link

Contents

739. Daily Temperatures

1. Question

2. Implementation

3. Time & Space Complexity

739. Daily Temperatures​

1. Question

2. Implementation

3. Time & Space Complexity

739. Daily Temperatures