feat: update solutions to leetcode problem: No.0496

Author: yanglbme

solution/0400-0499/0496.Next Greater Element I/README.md

@@ -40,22 +40,52 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+先对将 nums2 中的每一个元素，求出其下一个更大的元素。随后对于将这些答案放入哈希映射（HashMap）中，再遍历数组 nums1，并直接找出答案。对于 nums2，可以使用单调栈来解决这个问题。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def nextGreaterElement(self, nums1: List[int], nums2: List[int]) -> List[int]:
+        mapper = dict()
+        stack = []
+        for num in nums2:
+            while stack and stack[-1] < num:
+                mapper[stack.pop()] = num
+            stack.append(num)
+        res = []
+        for num in nums1:
+            res.append(mapper.get(num, -1))
+        return res
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int[] nextGreaterElement(int[] nums1, int[] nums2) {
+        Deque<Integer> stack = new ArrayDeque<>();
+        Map<Integer, Integer> map = new HashMap<>();
+        for (int num : nums2) {
+            while (!stack.isEmpty() && stack.peek() < num) {
+                map.put(stack.pop(), num);
+            }
+            stack.push(num);
+        }
+        int n = nums1.length;
+        int[] res = new int[n];
+        for (int i = 0; i < n; ++i) {
+            res[i] = map.getOrDefault(nums1[i], -1);
+        }
+        return res;
+    }
+}
 ```
 
 ### **...**

solution/0400-0499/0496.Next Greater Element I/README_EN.md

@@ -73,13 +73,41 @@ The Next Greater Number of a number <b>x</b> in <code>nums1</code> is the first
 ### **Python3**
 
 ```python
-
+class Solution:
+    def nextGreaterElement(self, nums1: List[int], nums2: List[int]) -> List[int]:
+        mapper = dict()
+        stack = []
+        for num in nums2:
+            while stack and stack[-1] < num:
+                mapper[stack.pop()] = num
+            stack.append(num)
+        res = []
+        for num in nums1:
+            res.append(mapper.get(num, -1))
+        return res
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int[] nextGreaterElement(int[] nums1, int[] nums2) {
+        Deque<Integer> stack = new ArrayDeque<>();
+        Map<Integer, Integer> map = new HashMap<>();
+        for (int num : nums2) {
+            while (!stack.isEmpty() && stack.peek() < num) {
+                map.put(stack.pop(), num);
+            }
+            stack.push(num);
+        }
+        int n = nums1.length;
+        int[] res = new int[n];
+        for (int i = 0; i < n; ++i) {
+            res[i] = map.getOrDefault(nums1[i], -1);
+        }
+        return res;
+    }
+}
 ```
 
 ### **...**

solution/0400-0499/0496.Next Greater Element I/Solution.java

@@ -3,15 +3,16 @@ public int[] nextGreaterElement(int[] nums1, int[] nums2) {
         Deque<Integer> stack = new ArrayDeque<>();
         Map<Integer, Integer> map = new HashMap<>();
         for (int num : nums2) {
-            while (!stack.isEmpty() && num > stack.peek()) {
+            while (!stack.isEmpty() && stack.peek() < num) {
                 map.put(stack.pop(), num);
             }
             stack.push(num);
         }
-        int[] res = new int[nums1.length];
-        for (int i = 0; i < nums1.length; ++i) {
+        int n = nums1.length;
+        int[] res = new int[n];
+        for (int i = 0; i < n; ++i) {
             res[i] = map.getOrDefault(nums1[i], -1);
         }
         return res;
     }
-}
+}

solution/0400-0499/0496.Next Greater Element I/Solution.py

@@ -0,0 +1,12 @@
+class Solution:
+    def nextGreaterElement(self, nums1: List[int], nums2: List[int]) -> List[int]:
+        mapper = dict()
+        stack = []
+        for num in nums2:
+            while stack and stack[-1] < num:
+                mapper[stack.pop()] = num
+            stack.append(num)
+        res = []
+        for num in nums1:
+            res.append(mapper.get(num, -1))
+        return res