algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 03:34:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0739.每日温度.md

Browse Source
This commit is contained in:
Martin Hsu
2022-01-04 14:08:00 +08:00
committed by GitHub
parent 6fe72f519a
commit a828e5f247
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
problems/0739.每日温度.md
View File

@ -119,7 +119,7 @@ C++代码如下：
class Solution { class Solution {
public: public:
vector<int> dailyTemperatures(vector<int>& T) { vector<int> dailyTemperatures(vector<int>& T) {
// 递减栈 // 递增栈
stack<int> st; stack<int> st;
vector<int> result(T.size(), 0); vector<int> result(T.size(), 0);
st.push(0); st.push(0);
@ -150,7 +150,7 @@ public:
class Solution { class Solution {
public: public:
vector<int> dailyTemperatures(vector<int>& T) { vector<int> dailyTemperatures(vector<int>& T) {
stack<int> st; // 递减栈 stack<int> st; // 递增栈
vector<int> result(T.size(), 0); vector<int> result(T.size(), 0);
for (int i = 0; i < T.size(); i++) { for (int i = 0; i < T.size(); i++) {
while (!st.empty() && T[i] > T[st.top()]) { // 注意栈不能为空 while (!st.empty() && T[i] > T[st.top()]) { // 注意栈不能为空
@ -178,7 +178,7 @@ public:
Java： Java：
```java ```java
/** /**
* 单调栈，栈内顺序要么从大到小 要么从小到大,本题从大到笑 * 单调栈，栈内顺序要么从大到小 要么从小到大,本题从大到小
* <p> * <p>
* 入站元素要和当前栈内栈首元素进行比较 * 入站元素要和当前栈内栈首元素进行比较
* 若大于栈首则 则与元素下标做差 * 若大于栈首则 则与元素下标做差