mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-09 03:34:02 +08:00
更新0496.下一个更大元素I.md Python3版本
This commit is contained in:
@ -185,3 +185,26 @@ public:
|
|||||||
|
|
||||||
建议大家把情况一二三想清楚了,先写出版本一的代码,然后在其基础上在做精简!
|
建议大家把情况一二三想清楚了,先写出版本一的代码,然后在其基础上在做精简!
|
||||||
|
|
||||||
|
## 其他语言版本
|
||||||
|
|
||||||
|
Python:
|
||||||
|
```python3
|
||||||
|
class Solution:
|
||||||
|
def nextGreaterElement(self, nums1: List[int], nums2: List[int]) -> List[int]:
|
||||||
|
result = [-1]*len(nums1)
|
||||||
|
stack = [0]
|
||||||
|
for i in range(1,len(nums2)):
|
||||||
|
# 情况一情况二
|
||||||
|
if nums2[i]<=nums2[stack[-1]]:
|
||||||
|
stack.append(i)
|
||||||
|
# 情况三
|
||||||
|
else:
|
||||||
|
while len(stack)!=0 and nums2[i]>nums2[stack[-1]]:
|
||||||
|
if nums2[stack[-1]] in nums1:
|
||||||
|
index = nums1.index(nums2[stack[-1]])
|
||||||
|
result[index]=nums2[i]
|
||||||
|
stack.pop()
|
||||||
|
stack.append(i)
|
||||||
|
return result
|
||||||
|
```
|
||||||
|
|
||||||
|
Reference in New Issue
Block a user