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

Author: longsizhuo

app/docs/CommunityShare/Leetcode/93复原Ip地址.md

@@ -1,10 +1,11 @@
 ---
 title: 93. Restore IP Addresses
-date: '2025/3/25-14:03'
+date: "2025/3/25-14:03"
 tags:
   - - Python
   - - Answer
 abbrlink: 9d0d3b9c
+docId: d5evrnoglwjvmyginjq84bl0
 ---
 
 # QUESTION：
@@ -23,7 +24,6 @@ If the pointer has reached the end of the string, it means we’ve visited all c
 One important note: `parts + [part]` is pass-by-value, not by reference like in LeetCode 46.
 This means we don’t need to manually undo changes (i.e., no need to backtrack with pop()), because each recursive call creates a new list.
 
-
 现在在做的是MiHoyo的笔试题, 这个和46.permutation非常相似, 都是回溯思想.
 
 如代码所示, 在第一遍遍历中, 我们会得到`['2','5','5','2']` 作为第一个parts, 但是我们并没有遍历完整个字符串.
@@ -32,6 +32,7 @@ This means we don’t need to manually undo changes (i.e., no need to backtrack
 指到的是最右边,所以当当前指针已经指到最右边的时候, 说明我们遍历完了所有字符, 那么这就是答案之一.
 
 `parts + [part]` 是值传递而不是46的引用传递, 所以不用手动撤销更改
+
 # Code：
 
 ```python
@@ -64,4 +65,4 @@ class Solution:
 
         backtrack(0, [])
         return res
-```
+```

generated/doc-contributors.json

@@ -1,8 +1,8 @@
 {
   "repo": "InvolutionHell/involutionhell",
-  "generatedAt": "2025-11-23T03:05:38.789Z",
+  "generatedAt": "2025-11-24T03:05:25.591Z",
   "docsDir": "app/docs",
-  "totalDocs": 121,
+  "totalDocs": 122,
   "results": [
     {
       "docId": "ue27z7z95yzw3lhhfj7nit1c",
@@ -2123,13 +2123,13 @@
       "docId": "lzrh7ftq3kegsyx8gimonrfu",
       "path": "app/docs/CommunityShare/Leetcode/2241. Design an ATM Machine.md",
       "contributorStats": {
-        "114939201": 1
+        "114939201": 2
       },
       "contributors": [
         {
           "githubId": "114939201",
-          "contributions": 1,
-          "lastContributedAt": "2025-11-23T03:00:11.000Z",
+          "contributions": 2,
+          "lastContributedAt": "2025-11-23T03:05:40.000Z",
           "login": "longsizhuo",
           "avatarUrl": "https://avatars.githubusercontent.com/u/114939201?v=4",
           "htmlUrl": "https://github.com/longsizhuo"
@@ -2238,6 +2238,23 @@
         }
       ]
     },
+    {
+      "docId": "d5evrnoglwjvmyginjq84bl0",
+      "path": "app/docs/CommunityShare/Leetcode/93复原Ip地址.md",
+      "contributorStats": {
+        "114939201": 1
+      },
+      "contributors": [
+        {
+          "githubId": "114939201",
+          "contributions": 1,
+          "lastContributedAt": "2025-11-24T03:00:36.000Z",
+          "login": "longsizhuo",
+          "avatarUrl": "https://avatars.githubusercontent.com/u/114939201?v=4",
+          "htmlUrl": "https://github.com/longsizhuo"
+        }
+      ]
+    },
     {
       "docId": "one7va4e0hvbq1eqhm6ww2kd",
       "path": "app/docs/CommunityShare/Leetcode/brief_alternate 作业帮忙_translated.md",