forked from armankhondker/leetcode-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdailyTemperatures.java
More file actions
23 lines (21 loc) · 865 Bytes
/
dailyTemperatures.java
File metadata and controls
23 lines (21 loc) · 865 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
// 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].
//TC: O(n) to go through temperatures
//SC: O(n) for stack
class Solution {
public int[] dailyTemperatures(int[] temperatures) {
Stack<Integer> stack = new Stack<>();
int[] ret = new int[temperatures.length];
for(int i = 0; i < temperatures.length; i++) {
while(!stack.isEmpty() && temperatures[i] > temperatures[stack.peek()]) {
int idx = stack.pop();
ret[idx] = i - idx;
}
stack.push(i);
}
return ret;
}
}