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

Author: longsizhuo

app/docs/CommunityShare/Leetcode/46.全排列.md

@@ -3,12 +3,14 @@ title: 46.permutations
 date: 24/3/2025
 tags:
   - Python
-  - '9021'
+  - "9021"
   - tree
 abbrlink: d567a4cd
+docId: mxt0ux1zpbzph4nuxz51eyg7
 ---
 
 # Description:
+
 Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.
 
 Example 1:
@@ -24,10 +26,11 @@ Example 3:
 Input: nums = [1]
 Output: [[1]]
 
-
 # Thinking:
+
 This question is more like a tree problem.
 like the tree below:
+
 ```shell
 dfs(0): nums = [1,2,3]
 |
@@ -56,12 +59,14 @@ dfs(0): nums = [1,2,3]
             |-- dfs(2): append [3,1,2]
 
 ```
+
 We swap the current position index with each possible candidate `i` from `index` to the end. They can be seen as left and right pointers: `index` determines which position we're filling, and `i` tries different numbers to place there.
 
-Before the recursive call, we swap `nums[i]` and `nums[index]` to try placing a new number at position index. If we reach the last position (`index == len(nums) - 1`), we add the current permutation to the answer list. 
+Before the recursive call, we swap `nums[i]` and `nums[index]` to try placing a new number at position index. If we reach the last position (`index == len(nums) - 1`), we add the current permutation to the answer list.
 After recursion, we swap back to restore the original state (backtracking).
 
 # Code:
+
 ```python
 class Solution:
     def permute(self, nums: List[int]) -> List[List[int]]:
@@ -79,4 +84,4 @@ class Solution:
         res = []
         dfs(0)
         return res
-```
+```

generated/doc-contributors.json

@@ -1,8 +1,8 @@
 {
   "repo": "InvolutionHell/involutionhell",
-  "generatedAt": "2025-11-24T03:05:25.591Z",
+  "generatedAt": "2025-11-25T03:06:12.634Z",
   "docsDir": "app/docs",
-  "totalDocs": 122,
+  "totalDocs": 123,
   "results": [
     {
       "docId": "ue27z7z95yzw3lhhfj7nit1c",
@@ -2221,6 +2221,23 @@
         }
       ]
     },
+    {
+      "docId": "mxt0ux1zpbzph4nuxz51eyg7",
+      "path": "app/docs/CommunityShare/Leetcode/46.全排列.md",
+      "contributorStats": {
+        "114939201": 1
+      },
+      "contributors": [
+        {
+          "githubId": "114939201",
+          "contributions": 1,
+          "lastContributedAt": "2025-11-25T03:00:08.000Z",
+          "login": "longsizhuo",
+          "avatarUrl": "https://avatars.githubusercontent.com/u/114939201?v=4",
+          "htmlUrl": "https://github.com/longsizhuo"
+        }
+      ]
+    },
     {
       "docId": "ryp6s59uwc10w2dywgs6f66h",
       "path": "app/docs/CommunityShare/Leetcode/80_translated.md",
@@ -2242,13 +2259,13 @@
       "docId": "d5evrnoglwjvmyginjq84bl0",
       "path": "app/docs/CommunityShare/Leetcode/93复原Ip地址.md",
       "contributorStats": {
-        "114939201": 1
+        "114939201": 2
       },
       "contributors": [
         {
           "githubId": "114939201",
-          "contributions": 1,
-          "lastContributedAt": "2025-11-24T03:00:36.000Z",
+          "contributions": 2,
+          "lastContributedAt": "2025-11-24T03:05:26.000Z",
           "login": "longsizhuo",
           "avatarUrl": "https://avatars.githubusercontent.com/u/114939201?v=4",
           "htmlUrl": "https://github.com/longsizhuo"