lurenaa的博客

😂代码实现

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
class Solution {
public:
vector<int> dailyTemperatures(vector<int>& T) {
stack<pair<int, int>> stk;
vector<int> vec(T.size(), 0);
for(int i = 0 ; i < T.size(); ++i) {
if(!stk.size()) {
stk.push({i, T[i]});
continue;
}
while(stk.size()) {
auto t = stk.top();
if(T[i] > t.second) {
stk.pop();
vec[t.first] = i - t.first;
} else
break;
}
stk.push({i, T[i]});
}
return vec;
}
};

Accepted

37/37 cases passed (108 ms)

Your runtime beats 65.63 % of cpp submissions

Your memory usage beats 5.03 % of cpp submissions (19.4 MB)