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

Author: longsizhuo

app/docs/CommunityShare/Leetcode/[2562]找出数组的串联值_translated.md

@@ -1,21 +1,27 @@
 ---
 title: 2562.Find the series of the array
-date: '2024.01.01 0:00'
+date: "2024.01.01 0:00"
 tags:
   - Python
   - answer
   - Array
   - Double pointer
   - simulation
 abbrlink: b625a0e1
+docId: naxatag8x2nnvkhbwdfc1azc
 ---
+
 # topic：
 
 [2562.Find the series of the array.md](https://leetcode-cn.com/problems/find-the-concatenation-of-an-array/)
+
 # Thought：
+
 This question andquiz4very similar，都是Double pointer。
 I made a mistake when I did this question，When calculating the right pointer, the negative index is calculated`right = -left + 1`，It is difficult to calculate the relationship between positive indexes，So replaced`right = len(nums) - 1 - left`。
+
 # Code：
+
 ```python
 class Solution:
     def findTheArrayConcVal(self, nums: List[int]) -> int:
@@ -28,4 +34,4 @@ class Solution:
             elif left < right:
                 sums += int(str(nums[left]) + str(nums[right]))
         return sums
-```
+```

generated/doc-contributors.json

@@ -1,8 +1,8 @@
 {
   "repo": "InvolutionHell/involutionhell",
-  "generatedAt": "2025-12-16T03:06:38.320Z",
+  "generatedAt": "2025-12-17T03:05:53.053Z",
   "docsDir": "app/docs",
-  "totalDocs": 144,
+  "totalDocs": 145,
   "results": [
     {
       "docId": "ue27z7z95yzw3lhhfj7nit1c",
@@ -2102,6 +2102,23 @@
         }
       ]
     },
+    {
+      "docId": "naxatag8x2nnvkhbwdfc1azc",
+      "path": "app/docs/CommunityShare/Leetcode/[2562]找出数组的串联值_translated.md",
+      "contributorStats": {
+        "114939201": 1
+      },
+      "contributors": [
+        {
+          "githubId": "114939201",
+          "contributions": 1,
+          "lastContributedAt": "2025-12-17T03:00:04.000Z",
+          "login": "longsizhuo",
+          "avatarUrl": "https://avatars.githubusercontent.com/u/114939201?v=4",
+          "htmlUrl": "https://github.com/longsizhuo"
+        }
+      ]
+    },
     {
       "docId": "p9gvb8klqv990cq88j4l76zy",
       "path": "app/docs/CommunityShare/Leetcode/[2582]递枕头_translated.md",
@@ -2455,13 +2472,13 @@
       "docId": "o3knuvbpnki6isfjv3g5ohau",
       "path": "app/docs/CommunityShare/Leetcode/3138. Minimum Length of Anagram Concatenation.md",
       "contributorStats": {
-        "114939201": 1
+        "114939201": 2
       },
       "contributors": [
         {
           "githubId": "114939201",
-          "contributions": 1,
-          "lastContributedAt": "2025-12-16T03:00:39.000Z",
+          "contributions": 2,
+          "lastContributedAt": "2025-12-16T03:06:39.000Z",
           "login": "longsizhuo",
           "avatarUrl": "https://avatars.githubusercontent.com/u/114939201?v=4",
           "htmlUrl": "https://github.com/longsizhuo"