Merge pull request #1658 from zhicheng-lee/zhicheng-lee-patch-14

更新 0496.下一个更大元素I.md Java代码

problems/0496.下一个更大元素I.md

@@ -221,6 +221,32 @@ class Solution {
         return res;
     }
 }
+
+// 版本2
+class Solution {
+    public int[] nextGreaterElement(int[] nums1, int[] nums2) {
+        HashMap<Integer, Integer> map = new HashMap<>();
+        for (int i = 0; i < nums1.length; i++) {
+            map.put(nums1[i], i);
+        }
+
+        int[] res = new int[nums1.length];
+        Stack<Integer> stack = new Stack<>();
+        Arrays.fill(res, -1);
+
+        for (int i = 0; i < nums2.length; i++) {
+            while (!stack.isEmpty() && nums2[stack.peek()] < nums2[i]) {
+                int pre = nums2[stack.pop()];
+                if (map.containsKey(pre)) {
+                    res[map.get(pre)] = nums2[i];
+                }
+            }
+            stack.push(i);
+        }
+
+        return res;
+    }
+}
 ```
 Python3：
 ```python