链接:https://leetcode-cn.com/problems/next-greater-element-i/
找数组元素左/右第一个比它大的元素,都可以用单调栈解决。这道题跟第一个数组没什么关系,对第二个数组使用单调栈即可。
java代码:
class Solution {
public int[] nextGreaterElement(int[] nums1, int[] nums2) {
Stack<Integer>stack = new Stack<>();
Map<Integer,Integer>map = new HashMap<>();
for(int i = 0;i<nums2.length;i++)
{
if(stack.isEmpty())
stack.push(nums2[i]);
else
{
while(!stack.isEmpty()&&nums2[i]>stack.peek())
{
int temp = stack.pop();
map.put(temp,nums2[i]);
}
stack.push(nums2[i]);
}
}
int [] result = new int [nums1.length];
for(int i = 0;i<nums1.length;i++)
{
result[i] = map.getOrDefault(nums1[i],-1);
}
return result;
}
}
python代码:
class Solution(object):
def nextGreaterElement(self, nums1, nums2):
"""
:type nums1: List[int]
:type nums2: List[int]
:rtype: List[int]
"""
stack, hash = [],{}
for n in nums2:
while stack and stack[-1] < n:
hash[stack.pop()] = n
stack.append(n)
return [hash.get(x,-1) for x in nums1]