From 636550d44c4ac65521865cca00b1c3c8b9f7c756 Mon Sep 17 00:00:00 2001
From: dmzlingyin <dmzlingyin@163.com>
Date: Fri, 29 Apr 2022 23:50:31 +0800
Subject: [PATCH] =?UTF-8?q?update=20(0739.=E6=AF=8F=E6=97=A5=E6=B8=A9?=
 =?UTF-8?q?=E5=BA=A6.md):=20=E5=A2=9E=E5=8A=A0=E6=9C=AA=E7=B2=BE=E7=AE=80?=
 =?UTF-8?q?=E7=89=88=E6=9C=ACGo=E4=BB=A3=E7=A0=81?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0739.每日温度.md | 30 +++++++++++++++++++++++++++++-
 1 file changed, 29 insertions(+), 1 deletion(-)

diff --git a/problems/0739.每日温度.md b/problems/0739.每日温度.md
index f0f782d2..206bebd2 100644
--- a/problems/0739.每日温度.md
+++ b/problems/0739.每日温度.md
@@ -277,8 +277,36 @@ func dailyTemperatures(t []int) []int {
 }
 ```
 
-> 单调栈法
+> 单调栈法(未精简版本)
 
+```go
+func dailyTemperatures(temperatures []int) []int {
+    res := make([]int, len(temperatures))
+    // 初始化栈顶元素为第一个下标索引0
+    stack := []int{0}
+
+    for i := 1; i < len(temperatures); i++ {
+        top := stack[len(stack)-1]
+        if temperatures[i] < temperatures[top] {
+            stack = append(stack, i)
+        } else if temperatures[i] ==  temperatures[top] {
+            stack = append(stack, i)
+        } else {
+            for len(stack) != 0 && temperatures[i] > temperatures[top] {
+                res[top] = i - top
+                stack = stack[:len(stack)-1]
+                if len(stack) != 0 {
+                    top = stack[len(stack)-1]
+                }
+            }
+            stack = append(stack, i)
+        }
+    }
+    return res
+}
+```
+
+> 单调栈法(精简版本)
 ```go
 // 单调递减栈
 func dailyTemperatures(num []int) []int {