739. Daily Temperatures
- 情况一:当前遍历的元素T[i]小于栈顶元素T[st.top()]的情况
- 情况二:当前遍历的元素T[i]等于栈顶元素T[st.top()]的情况
- 情况三:当前遍历的元素T[i]大于栈顶元素T[st.top()]的情况
class Solution:
def dailyTemperatures(self, temperatures: List[int]) -> List[int]:
res = [0] * len(temperatures)
stack = [0]
for i in range(1, len(temperatures)):
if temperatures[i] < temperatures[stack[-1]]:
stack.append(i)
elif temperatures[i] == temperatures[stack[-1]]:
stack.append(i)
else:
while stack and temperatures[i] > temperatures[stack[-1]]:
res[stack[-1]] = i - stack[-1]
stack.pop()
stack.append(i)
return res
496. Next Greater Element I
在遍历nums2的过程中,我们要判断nums2[i]是否在nums1中出现过,因为最后是要根据nums1元素的下标来更新result数组
class Solution:
def nextGreaterElement(self, nums1: List[int], nums2: List[int]) -> List[int]:
stack = []
res = [-1] * len(nums1)
map = dict()
for i in range(len(nums1)): # 建立映射
map[nums1[i]] = i
stack.append(0)
for i in range(1, len(nums2)):
if nums2[i] < nums2[stack[-1]]:
stack.append(i)
elif nums2[i] == nums2[stack[-1]]:
stack.append(i)
else:
while stack and nums2[i] > nums2[stack[-1]]:
if nums2[stack[-1]] in map:
index = map[nums2[stack[-1]]] # 在nums1中定位
res[index] = nums2[i]
stack.pop()
stack.append(i)
return res