-
Notifications
You must be signed in to change notification settings - Fork 1
/
DailyTemperature.java
47 lines (37 loc) · 1.32 KB
/
DailyTemperature.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
/**
Given an array of integers temperatures represents the daily temperatures, return an array answer such that answer[i] is the number of days you have to wait after the ith day to get a warmer temperature. If there is no future day for which this is possible, keep answer[i] == 0 instead.
Example 1:
Input: temperatures = [73,74,75,71,69,72,76,73]
Output: [1,1,4,2,1,1,0,0]
Example 2:
Input: temperatures = [30,40,50,60]
Output: [1,1,1,0]
Example 3:
Input: temperatures = [30,60,90]
Output: [1,1,0]
**/
class Solution {
//number of days you have to wait after the ith day to get a warmer temperature
/**
Input: temperatures = [73,74,75,71,69,72,76,73]
Output: [1,1,4,2,1,1,0,0]
**/
public int[] dailyTemperatures(int[] temperatures) {
Stack<Integer> stack = new Stack<>();//stores index
int n = temperatures.length;
int[] result = new int[n];
for(int i = n -1 ; i >=0 ; i--){
int t = temperatures[i];
while(stack.size() > 0 && temperatures[stack.peek()] <= t){//even remove when equal
stack.pop();
}
int count = 0;
if(stack.size() > 0){
count = stack.peek() - i;
}
result[i] = count;
stack.push(i);
}
return result;
}
}