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

Update 0503.下一个更大元素II.md

Browse Source 
move second solution to 0496.下一个更大元素I
This commit is contained in:
0zz10
2024-01-21 15:40:51 -08:00
committed by GitHub
parent 9928779dcf
commit 68cdbdbb90
1 changed files with 0 additions and 21 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
problems/0503.下一个更大元素II.md
View File

@ -170,7 +170,6 @@ class Solution {
### Python: ### Python:
```python ```python
# 方法 1:
class Solution: class Solution:
def nextGreaterElements(self, nums: List[int]) -> List[int]: def nextGreaterElements(self, nums: List[int]) -> List[int]:
dp = [-1] * len(nums) dp = [-1] * len(nums)
@ -181,26 +180,6 @@ class Solution:
stack.pop() stack.pop()
stack.append(i%len(nums)) stack.append(i%len(nums))
return dp return dp
# 方法 2:
class Solution:
def nextGreaterElement(self, nums1: List[int], nums2: List[int]) -> List[int]:
stack = []
# 创建答案数组
ans = [-1] * len(nums1)
for i in range(len(nums2)):
while len(stack) > 0 and nums2[i] > nums2[stack[-1]]:
# 判断 num1 是否有 nums2[stack[-1]]。如果没有这个判断会出现指针异常
if nums2[stack[-1]] in nums1:
# 锁定 num1 检索的 index
index = nums1.index(nums2[stack[-1]])
# 更新答案数组
ans[index] = nums2[i]
# 弹出小元素
# 这个代码一定要放在 if 外面。否则单调栈的逻辑就不成立了
stack.pop()
stack.append(i)
return ans
``` ```
### Go: ### Go: