单调栈问题-下一个更大元素 I

题目

使用单调栈来进行维护所有的下一个第一个最大值

代码：

class Solution {
    public int[] nextGreaterElement(int[] nums1, int[] nums2) {


        Stack<Integer> stack = new Stack<>();
        Map<Integer, Integer> result = new HashMap<>();

        for (int index = nums2.length - 1; index >= 0; index--) {

            if (stack.isEmpty()) {
                result.put(nums2[index] , -1);
                stack.push(nums2[index]);
            } else {
                Integer peek = stack.peek();

                if (nums2[index] < peek) {
                    result.put(nums2[index], peek);
                    stack.push(nums2[index]);
                } else {

                    while (!stack.isEmpty()) {
                        peek = stack.peek();

                        if (nums2[index] < peek) {
                            result.put(nums2[index], peek);
                            stack.push(nums2[index]);
                            break;
                        } else {
                            stack.pop();
                        }

                    }
                    if (stack.isEmpty()) {
                        result.put(nums2[index], -1);
                        stack.push(nums2[index]);
                    }

                }

            }


        }

        int[] sink = new int[nums1.length];
        for (int i = 0; i < nums1.length; i++) {
            sink[i] = result.get(nums1[i]);
        }

        return sink;

    }
}