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

Author: longsizhuo

app/docs/CommunityShare/Leetcode/剑指 Offer II 021. 删除链表的倒数第 n 个结点_translated.md

@@ -1,17 +1,19 @@
 ---
 title: Sword finger Offer II 021. Delete the countdown of the linked list n Node.md
-date: '2024.01.01 0:00'
+date: "2024.01.01 0:00"
 tags:
   - - Python
   - - answer
 abbrlink: 3ed2f01c
+docId: qfvqmc1exp066falnsg97c5m
 ---
 
 # topic：
 
 [Sword finger Offer II 021. Delete the countdown of the linked list n Node.md](https://leetcode.cn/problems/SLwz0R/description/)
 
 # Thought：
+
 Double pointer（Sliding window algorithm）。
 In this method，We first created a virtual head node dummy，And point it to the original head point head。
 Then we use two pointers fast and slow，Will fast Poor movement move forward n step。
@@ -21,9 +23,10 @@ at this time，slow pointer指向倒数第 n+1 Node，我们Will其 next pointer
 at last，We return virtual head nodes next pointer，It points to delete the countdown n Node后的链表的Head node。
 
 At the beginning, according toCLinked
+
 # Code：
 
-```python   Sliding window algorithm
+```python Sliding window algorithm
 class Solution:
     def removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:
         # Create a virtual head node
@@ -90,4 +93,4 @@ def list_to_linked_list(lst):
         current = current.next
 
     return head
-```
+```

generated/doc-contributors.json

@@ -1,8 +1,8 @@
 {
   "repo": "InvolutionHell/involutionhell",
-  "generatedAt": "2025-11-09T14:18:37.524Z",
+  "generatedAt": "2025-11-10T03:06:22.583Z",
   "docsDir": "app/docs",
-  "totalDocs": 107,
+  "totalDocs": 108,
   "results": [
     {
       "docId": "ue27z7z95yzw3lhhfj7nit1c",
@@ -2037,14 +2037,31 @@
     {
       "docId": "clx9mmqqvxipdfamqciuo146",
       "path": "app/docs/CommunityShare/Leetcode/2679.矩阵中的和_translated.md",
+      "contributorStats": {
+        "114939201": 2
+      },
+      "contributors": [
+        {
+          "githubId": "114939201",
+          "contributions": 2,
+          "lastContributedAt": "2025-11-09T14:18:38.000Z",
+          "login": "longsizhuo",
+          "avatarUrl": "https://avatars.githubusercontent.com/u/114939201?v=4",
+          "htmlUrl": "https://github.com/longsizhuo"
+        }
+      ]
+    },
+    {
+      "docId": "qfvqmc1exp066falnsg97c5m",
+      "path": "app/docs/CommunityShare/Leetcode/剑指 Offer II 021. 删除链表的倒数第 n 个结点_translated.md",
       "contributorStats": {
         "114939201": 1
       },
       "contributors": [
         {
           "githubId": "114939201",
           "contributions": 1,
-          "lastContributedAt": "2025-11-09T14:12:37.000Z",
+          "lastContributedAt": "2025-11-10T03:00:27.000Z",
           "login": "longsizhuo",
           "avatarUrl": "https://avatars.githubusercontent.com/u/114939201?v=4",
           "htmlUrl": "https://github.com/longsizhuo"