完成496

Author: diguage

README.adoc

@@ -3985,15 +3985,15 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 //|{doc_base_url}/0495-teemo-attacking.adoc[题解]
 //|Medium
 //|
-//
-//|{counter:codes}
-//|496
-//|{leetcode_base_url}/next-greater-element-i/[Next Greater Element I]
-//|{source_base_url}/_0496_NextGreaterElementI.java[Java]
-//|{doc_base_url}/0496-next-greater-element-i.adoc[题解]
-//|Easy
-//|
-//
+
+|{counter:codes}
+|496
+|{leetcode_base_url}/next-greater-element-i/[Next Greater Element I]
+|{source_base_url}/_0496_NextGreaterElementI.java[Java]
+|{doc_base_url}/0496-next-greater-element-i.adoc[题解]
+|Easy
+|
+
 //|{counter:codes}
 //|497
 //|{leetcode_base_url}/random-point-in-non-overlapping-rectangles/[Random Point in Non-overlapping Rectangles]

docs/0000-23-monotonic-stack.adoc

@@ -7,8 +7,9 @@
 . xref:0084-largest-rectangle-in-histogram.adoc[84. Largest Rectangle in Histogram]
 . xref:0503-next-greater-element-ii.adoc[503. Next Greater Element II]
 . xref:0042-trapping-rain-water.adoc[42. Trapping Rain Water]
+. xref:0496-next-greater-element-i.adoc[496. Next Greater Element I]
 
 == 参考资料
 
 . https://cloud.tencent.com/developer/article/1998273[单调栈详解及其LeetCode应用详解^]
-.
+. https://blog.csdn.net/weixin_50348837/article/details/136304458[深入理解单调栈算法，这一篇就够了^]

docs/0000-data-structure-list.adoc

@@ -14,6 +14,11 @@
 . xref:1094-car-pooling.adoc[1094. Car Pooling]
 . xref:1109-corporate-flight-bookings.adoc[1109. Corporate Flight Bookings]
 
+=== 单调栈
+
+详情见 xref:0000-23-monotonic-stack.adoc[Monotonic Stack 单调栈]
+
+
 
 == 参考资料
 

docs/0496-next-greater-element-i.adoc

@@ -6,14 +6,11 @@ https://leetcode.com/problems/next-greater-element-i/[LeetCode - Next Greater El
 
 You are given two arrays *(without duplicates)* `nums1` and `nums2` where `nums1`’s elements are subset of `nums2`. Find all the next greater numbers for `nums1`'s elements in the corresponding places of `nums2`. 
 
-
-
 The Next Greater Number of a number *x* in `nums1` is the first greater number to its right in `nums2`. If it does not exist, output -1 for this number.
 
 
 *Example 1:*
 
-
 [subs="verbatim,quotes,macros"]
 ----
 *Input:* *nums1* = [4,1,2], *nums2* = [1,3,4,2].
@@ -27,7 +24,6 @@ The Next Greater Number of a number *x* in `nums1` is the first greater number t
 
 *Example 2:*
 
-
 [subs="verbatim,quotes,macros"]
 ----
 *Input:* *nums1* = [2,4], *nums2* = [1,2,3,4].
@@ -38,13 +34,40 @@ The Next Greater Number of a number *x* in `nums1` is the first greater number t
 ----
 
 
-
 *Note:*
 
 . All elements in `nums1` and `nums2` are unique.
 . The length of both `nums1` and `nums2` would not exceed 1000.
 
+== 思路分析
+
+单调栈
+
+image::images/0496-01.png[{image_attr}]
+
+image::images/0496-02.png[{image_attr}]
+
+image::images/0496-03.png[{image_attr}]
+
+image::images/0496-04.png[{image_attr}]
 
+image::images/0496-05.png[{image_attr}]
+
+image::images/0496-06.png[{image_attr}]
+
+image::images/0496-07.png[{image_attr}]
+
+image::images/0496-08.png[{image_attr}]
+
+image::images/0496-09.png[{image_attr}]
+
+image::images/0496-10.png[{image_attr}]
+
+image::images/0496-11.png[{image_attr}]
+
+image::images/0496-12.png[{image_attr}]
+
+image::images/0496-13.png[{image_attr}]
 
 
 [[src-0496]]
@@ -53,3 +76,8 @@ The Next Greater Number of a number *x* in `nums1` is the first greater number t
 include::{sourcedir}/_0496_NextGreaterElementI.java[]
 ----
 
+== 参考资料
+
+. https://leetcode.cn/problems/next-greater-element-i/solutions/1065517/xia-yi-ge-geng-da-yuan-su-i-by-leetcode-bfcoj/[496. 下一个更大元素 I - 官方题解^]
+. https://leetcode.cn/problems/next-greater-element-i/solutions/2820648/shi-pin-dan-diao-zhan-de-liang-chong-xie-ri0i/[496. 下一个更大元素 I - 单调栈的两种写法，附单调栈题单^]
+

docs/images/0496-01.png

@@ -295,6 +295,12 @@
 |{doc_base_url}/0710-random-pick-with-blacklist.adoc[题解]
 |把映射处理好
 
+|{counter:codes}
+|496
+|{leetcode_base_url}/next-greater-element-i/[Next Greater Element I]
+|{doc_base_url}/0496-next-greater-element-i.adoc[题解]
+|单调栈，理解不是很透彻，还需要加强练习
+
 
 |===
 

docs/images/0496-02.png

@@ -0,0 +1,33 @@
+package com.diguage.algorithm.leetcode;
+
+import java.util.Deque;
+import java.util.HashMap;
+import java.util.LinkedList;
+import java.util.Map;
+
+/**
+ * @author D瓜哥 · https://www.diguage.com
+ * @since 2024-07-05 22:40:25
+ */
+public class _0496_NextGreaterElementI {
+  /**
+   * 单调栈，参考模板，自己书写
+   */
+  public int[] nextGreaterElement(int[] nums1, int[] nums2) {
+    Deque<Integer> stack = new LinkedList<>();
+    Map<Integer, Integer> big = new HashMap<>();
+    for (int i = nums2.length - 1; i >= 0; i--) {
+      while (!stack.isEmpty() && stack.peek() < nums2[i]) {
+        stack.pop();
+      }
+      int val = stack.isEmpty() ? -1 : stack.peek();
+      big.put(nums2[i], val);
+      stack.push(nums2[i]);
+    }
+    int[] result = new int[nums1.length];
+    for (int i = 0; i < nums1.length; i++) {
+      result[i] = big.get(nums1[i]);
+    }
+    return result;
+  }
+}