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

Author: longsizhuo

app/docs/CommunityShare/Leetcode/1664生成平衡数组的方案数_translated.md

@@ -1,12 +1,13 @@
 ---
 title: 1664. Number of schemes to generate balance numbers One question daily
-date: '2024.01.01 0:00'
+date: "2024.01.01 0:00"
 tags:
   - - Python
   - - answer
   - - Dynamic planning
   - - One question daily
 abbrlink: 1978f474
+docId: ska0npc89ja1r4pdt2qow79u
 ---
 
 [1664. Number of schemes to generate balance numbers](https://leetcode.cn/problems/ways-to-make-a-fair-array/description/?orderBy=most_relevant)
@@ -17,15 +18,16 @@ See when you read the question medium I know that it is definitely not really go
 But it's timeout。。
 
 然后看官方answer，用的Dynamic planning。中心Thought是：
->General nature，Now we will settle down i Delete elements，
-Obviously the bidding i The previous element bidding will not change from this，Bidding i 
-The original was originally j，j>iThe array elements of the bid will move to the bidding j−1，
-Immediately bidding i The subsequent bidding elements will become the rated element，
-The even bidding element will become a strange number of bidding elements。
+
+> General nature，Now we will settle down i Delete elements，
+> Obviously the bidding i The previous element bidding will not change from this，Bidding i
+> The original was originally j，j>iThe array elements of the bid will move to the bidding j−1，
+> Immediately bidding i The subsequent bidding elements will become the rated element，
+> The even bidding element will become a strange number of bidding elements。
 
 # Code
 
-```python  slice
+```python slice
 class Solution:
     def waysToMakeFair(self, nums: List[int]) -> int:
         flag = 0
@@ -36,9 +38,7 @@ class Solution:
         return flag
 ```
 
-
-
-```python  官方answer
+```python 官方answer
 class Solution:
     def waysToMakeFair(self, nums: List[int]) -> int:
         res = odd1 = even1 = odd2 = even2 = 0
@@ -60,13 +60,3 @@ class Solution:
                 even1 += num
         return res
 ```
-
-
-
-
-
-
-
-
-
-

generated/doc-contributors.json

@@ -1,8 +1,8 @@
 {
   "repo": "InvolutionHell/involutionhell",
-  "generatedAt": "2025-12-17T03:05:53.053Z",
+  "generatedAt": "2025-12-18T03:07:56.884Z",
   "docsDir": "app/docs",
-  "totalDocs": 145,
+  "totalDocs": 146,
   "results": [
     {
       "docId": "ue27z7z95yzw3lhhfj7nit1c",
@@ -2106,13 +2106,13 @@
       "docId": "naxatag8x2nnvkhbwdfc1azc",
       "path": "app/docs/CommunityShare/Leetcode/[2562]找出数组的串联值_translated.md",
       "contributorStats": {
-        "114939201": 1
+        "114939201": 2
       },
       "contributors": [
         {
           "githubId": "114939201",
-          "contributions": 1,
-          "lastContributedAt": "2025-12-17T03:00:04.000Z",
+          "contributions": 2,
+          "lastContributedAt": "2025-12-17T03:05:54.000Z",
           "login": "longsizhuo",
           "avatarUrl": "https://avatars.githubusercontent.com/u/114939201?v=4",
           "htmlUrl": "https://github.com/longsizhuo"
@@ -2213,6 +2213,23 @@
         }
       ]
     },
+    {
+      "docId": "ska0npc89ja1r4pdt2qow79u",
+      "path": "app/docs/CommunityShare/Leetcode/1664生成平衡数组的方案数_translated.md",
+      "contributorStats": {
+        "114939201": 1
+      },
+      "contributors": [
+        {
+          "githubId": "114939201",
+          "contributions": 1,
+          "lastContributedAt": "2025-12-18T03:00:39.000Z",
+          "login": "longsizhuo",
+          "avatarUrl": "https://avatars.githubusercontent.com/u/114939201?v=4",
+          "htmlUrl": "https://github.com/longsizhuo"
+        }
+      ]
+    },
     {
       "docId": "n38sohi8zlxesl82tgv854kj",
       "path": "app/docs/CommunityShare/Leetcode/1825求出 MK 平均值_translated.md",