-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDay7.cpp
More file actions
38 lines (32 loc) · 1.1 KB
/
Day7.cpp
File metadata and controls
38 lines (32 loc) · 1.1 KB
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
// Question
// 739. Daily Temperatures
// 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]
// Constraints:
// 1 <= temperatures.length <= 105
// 30 <= temperatures[i] <= 100
// Solution
class Solution {
public:
vector<int> dailyTemperatures(vector<int>& temperatures) {
vector<int> ans(temperatures.size());
stack<int> stack; // a decreasing stack
for (int i = 0; i < temperatures.size(); ++i) {
while (!stack.empty() && temperatures[stack.top()] < temperatures[i]) {
const int index = stack.top();
stack.pop();
ans[index] = i - index;
}
stack.push(i);
}
return ans;
}
};