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

Author: longsizhuo

app/docs/CommunityShare/Leetcode/2341. 数组能形成多少数对_translated.md

@@ -4,25 +4,30 @@ tags:
   - - Python
   - - answer
 abbrlink: f953c753
-date: '2024.01.01 0:00'
+date: "2024.01.01 0:00"
+docId: s3w19zdm6yhkhj4o0ba3kbal
 ---
 
 # topic：
 
 [2341. How much can the array be formed.md](https://leetcode.cn/problems/maximum-number-of-pairs-in-array/description/)
 
 # Thought：
+
 ## I am：
+
 I don't know if I saw it“Simple”Two words，This question has the initiative to think about the optimal solution。Actually this timeylbBig guy's hash table method is still fast。
 Sort the list，Whether two or two are equal to whether。
+
 ## Hash tableThought：
+
 CounterAfter counting，`a+=v//2`,`b+=v%2`For each number x，
 if x Number of times v more than the 1，You can choose two from the array x Form a number pair，we willv Divide 2 Take down，
 You can get the current number x Number pairs that can be formed，Then we accumulate this number to the variable s middle。
 
 # Code：
 
-```python   Ordinary count
+```python Ordinary count
 class Solution:
     def numberOfPairs(self, nums: List[int]) -> List[int]:
         nums.sort()
@@ -34,7 +39,8 @@ class Solution:
                 nums[index - 1] = nums[index] = -1
         return ans
 ```
-```python   Hash table
+
+```python Hash table
 class Solution:
     def numberOfPairs(self, nums: List[int]) -> List[int]:
         x = Counter(nums)
@@ -44,4 +50,4 @@ class Solution:
             a+=v//2
             b+=v%2
         return [a,b]
-```
+```

generated/doc-contributors.json

@@ -1,8 +1,8 @@
 {
   "repo": "InvolutionHell/involutionhell",
-  "generatedAt": "2025-12-12T03:07:57.932Z",
+  "generatedAt": "2025-12-13T03:06:52.333Z",
   "docsDir": "app/docs",
-  "totalDocs": 140,
+  "totalDocs": 141,
   "results": [
     {
       "docId": "ue27z7z95yzw3lhhfj7nit1c",
@@ -2340,6 +2340,23 @@
         }
       ]
     },
+    {
+      "docId": "s3w19zdm6yhkhj4o0ba3kbal",
+      "path": "app/docs/CommunityShare/Leetcode/2341. 数组能形成多少数对_translated.md",
+      "contributorStats": {
+        "114939201": 1
+      },
+      "contributors": [
+        {
+          "githubId": "114939201",
+          "contributions": 1,
+          "lastContributedAt": "2025-12-13T03:00:10.000Z",
+          "login": "longsizhuo",
+          "avatarUrl": "https://avatars.githubusercontent.com/u/114939201?v=4",
+          "htmlUrl": "https://github.com/longsizhuo"
+        }
+      ]
+    },
     {
       "docId": "lnx1bszj5aqqqfa50sejjv7n",
       "path": "app/docs/CommunityShare/Leetcode/2639. 查询网格图中每一列的宽度_translated.md",
@@ -2378,13 +2395,13 @@
       "docId": "y0ntwlksnvj7ymuapqvkvmwr",
       "path": "app/docs/CommunityShare/Leetcode/2894. 分类求和并作差.md",
       "contributorStats": {
-        "114939201": 1
+        "114939201": 2
       },
       "contributors": [
         {
           "githubId": "114939201",
-          "contributions": 1,
-          "lastContributedAt": "2025-12-12T03:00:48.000Z",
+          "contributions": 2,
+          "lastContributedAt": "2025-12-12T03:07:58.000Z",
           "login": "longsizhuo",
           "avatarUrl": "https://avatars.githubusercontent.com/u/114939201?v=4",
           "htmlUrl": "https://github.com/longsizhuo"