From 6eb35a973796c440fde91ae5ef66fe75c1dfb426 Mon Sep 17 00:00:00 2001
From: markwang <www.wang61@qq.com>
Date: Wed, 23 Oct 2024 16:19:36 +0800
Subject: [PATCH] =?UTF-8?q?503.=E4=B8=8B=E4=B8=80=E4=B8=AA=E6=9B=B4?=
 =?UTF-8?q?=E5=A4=A7=E5=85=83=E7=B4=A0II=E5=A2=9E=E5=8A=A0Go=E7=89=88?=
 =?UTF-8?q?=E6=9C=AC=E4=B8=80=E8=A7=A3=E6=B3=95?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0503.下一个更大元素II.md | 34 ++++++++++++++++++++++++
 1 file changed, 34 insertions(+)

diff --git a/problems/0503.下一个更大元素II.md b/problems/0503.下一个更大元素II.md
index 5751bb91..fdbdc1cf 100644
--- a/problems/0503.下一个更大元素II.md
+++ b/problems/0503.下一个更大元素II.md
@@ -213,6 +213,40 @@ class Solution:
 ### Go:
 
 ```go
+// 版本一
+func nextGreaterElements(nums []int) []int {
+    // 拼接一个新的nums
+    numsNew := make([]int, len(nums) * 2)
+    copy(numsNew, nums)
+    copy(numsNew[len(nums):], nums)
+    // 用新的nums大小来初始化result
+    result := make([]int, len(numsNew))
+    for i := range result {
+        result[i] = -1
+    }
+    
+    // 开始单调栈
+    st := []int{0}
+    for i := 1; i < len(numsNew); i++ {
+        if numsNew[i] < numsNew[st[len(st)-1]] {
+            st = append(st, i)
+        } else if numsNew[i] == numsNew[st[len(st)-1]] {
+            st = append(st, i)
+        } else {
+            for len(st) > 0 && numsNew[i] > numsNew[st[len(st)-1]] {
+                result[st[len(st)-1]] = numsNew[i]
+                st = st[:len(st)-1]
+            }
+            st = append(st, i)
+        }
+    }
+    result = result[:len(result)/2]
+    return result
+}
+```
+
+```go
+// 版本二
 func nextGreaterElements(nums []int) []int {
     length := len(nums)
     result := make([]int,length)