chore(docs): sync doc metadata [skip ci]

Author: longsizhuo

app/docs/CommunityShare/Leetcode/42.md

@@ -1,30 +1,31 @@
 ---
 title: 42.md
-date: '2025/3/27-19:56'
+date: "2025/3/27-19:56"
 tags:
   - - Python
   - - Answer
 abbrlink: 60fe0230
+docId: jv8qj3ljyr2uomaehnv0l77k
 ---
 
 # QUESTION：
+
 [42.md]()
 
 # My Think：
 
 滚瓜烂熟的一道题, 全部靠背诵. 但是昨天又理解了一下, 画了一个GIF图供我自己理解, 代码如下,
 
 图片举例: `[0,1,0,2,1,0,1,3,2,1,2,1]`
-该题的核心思想其实就是木桶原理, 我们将最外面的两个柱子视作玛丽亚之墙, 这个时候我们忽略玛丽亚之墙内部的城墙, 那么最多是不是可以装`min(leftmax, rightmax)`这么高的水呢? 
+该题的核心思想其实就是木桶原理, 我们将最外面的两个柱子视作玛丽亚之墙, 这个时候我们忽略玛丽亚之墙内部的城墙, 那么最多是不是可以装`min(leftmax, rightmax)`这么高的水呢?
 也就是最短的柱子的水决定了它的"高度". 但是我们想知道最多能装多少水, 还需要一个宽度. 于是这个时候我们就一根一根柱子看, 也就是说我们计算每"1"个宽度能装多少水, 然后加起来即可.
-我们的左指针为`left`, 右指针为`right`, 我们再维护一个左边最高和右边最高. 
+我们的左指针为`left`, 右指针为`right`, 我们再维护一个左边最高和右边最高.
 当我们到达最外面的玛丽亚之墙的时候, 左最高即为`leftmax`, 右最高即为`rightmax`, 这个时候我们是无法判断可以装多少水的.
-一直到`leftmost`!=`rightmost`的时候, 我们就可以判断了. 
+一直到`leftmost`!=`rightmost`的时候, 我们就可以判断了.
 
 比如这一帧, 我们最多能装的是`leftmax`的水量, 即`2`, 但是因为我们这个时候左指针所在的柱子有一定高度`1`, 所以是`2-1=1`, 也就是我们能装`1`的水.
 如果我们比较的不是`leftmost`和`rightmost`, 而是`leftmax`和`rightmax`, 我们就无法确定说这一个柱子为什么能够兜得住水, 它之所以能兜住水,必然是<=`leftmax`的
 
-
 This is a problem I’ve memorized inside out — totally muscle memory. But I revisited it yesterday and tried to actually understand it. I even made a GIF to help myself visualize what's happening. Here's the code:
 
 Let's use the example: [0,1,0,2,1,0,1,3,2,1,2,1]
@@ -43,14 +44,14 @@ When our pointer reaches the end of the string (or the two walls meet), that mea
 
 Take this specific frame as an example:
 
-
-At this point, the max water we can hold is leftmax = 2, but the current column has height 1, so we can trap: 
+At this point, the max water we can hold is leftmax = 2, but the current column has height 1, so we can trap:
 
 `2 - 1 = 1` unit of water.
 
 If we were comparing leftmax and rightmax directly, we wouldn’t know why this particular column can hold water. The only reason it can trap water is because its height is less than or equal to leftmax.
 
 # Code：
+
 ```python
 class Solution:
     def trap(self, height: list[int]) -> int:
@@ -67,6 +68,7 @@ class Solution:
                 right -= 1
         return ans
 ```
+
 ```python
 import matplotlib.pyplot as plt
 import matplotlib.animation as animation
@@ -120,4 +122,4 @@ ani = animation.FuncAnimation(fig, update, frames=frames, interval=500, repeat=F
 
 from IPython.display import HTML
 ani.save("trapping_rain_water.gif", writer="pillow", fps=2)  # 保存为 GIF
-```
+```

generated/doc-contributors.json

@@ -1,8 +1,8 @@
 {
   "repo": "InvolutionHell/involutionhell",
-  "generatedAt": "2025-12-10T03:07:16.426Z",
+  "generatedAt": "2025-12-11T03:06:09.120Z",
   "docsDir": "app/docs",
-  "totalDocs": 138,
+  "totalDocs": 139,
   "results": [
     {
       "docId": "ue27z7z95yzw3lhhfj7nit1c",
@@ -2225,13 +2225,13 @@
       "docId": "k4btd9x3l3xnnl4dnr64d8cq",
       "path": "app/docs/CommunityShare/Leetcode/219_translated.md",
       "contributorStats": {
-        "114939201": 1
+        "114939201": 2
       },
       "contributors": [
         {
           "githubId": "114939201",
-          "contributions": 1,
-          "lastContributedAt": "2025-12-10T03:00:13.000Z",
+          "contributions": 2,
+          "lastContributedAt": "2025-12-10T03:07:17.000Z",
           "login": "longsizhuo",
           "avatarUrl": "https://avatars.githubusercontent.com/u/114939201?v=4",
           "htmlUrl": "https://github.com/longsizhuo"
@@ -2408,6 +2408,23 @@
         }
       ]
     },
+    {
+      "docId": "jv8qj3ljyr2uomaehnv0l77k",
+      "path": "app/docs/CommunityShare/Leetcode/42.md",
+      "contributorStats": {
+        "114939201": 1
+      },
+      "contributors": [
+        {
+          "githubId": "114939201",
+          "contributions": 1,
+          "lastContributedAt": "2025-12-11T03:00:46.000Z",
+          "login": "longsizhuo",
+          "avatarUrl": "https://avatars.githubusercontent.com/u/114939201?v=4",
+          "htmlUrl": "https://github.com/longsizhuo"
+        }
+      ]
+    },
     {
       "docId": "mxt0ux1zpbzph4nuxz51eyg7",
       "path": "app/docs/CommunityShare/Leetcode/46.全排列.md",