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

Author: longsizhuo

app/docs/CommunityShare/Leetcode/1653. 使字符串平衡的最少删除次数_translated.md

@@ -1,10 +1,11 @@
 ---
 title: 1653. The minimum number of times to balance the string balance.md
-date: '2024.01.01 0:00'
+date: "2024.01.01 0:00"
 tags:
   - - Python
   - - answer
 abbrlink: cac21f27
+docId: bsf0yz1zrmlz7masrdmq8fq6
 ---
 
 # topic：
@@ -13,7 +14,7 @@ abbrlink: cac21f27
 
 # Thought：
 
-ask：Why if-else Write (c - 'a') * 2 - 1 It will be much faster？
+ask：Why if-else Write (c - 'a') \* 2 - 1 It will be much faster？
 
 answer：CPU I encounter a branch（Condition jump instruction）Which branch of the code will be predicted when the code is executed，If the prediction is correct，
 CPU It will continue to execute the program in accordance with the predicted path。But if the prediction fails，CPU You need to roll back the previous instructions and load the correct instructions，To ensure the correctness of the program execution。
@@ -23,7 +24,6 @@ For the data of this question，character ‘a’ and ‘b’ It can be consider
 
 Notice：This optimization method often reduces readability，It's best not to use in business code。
 
-
 # Code：
 
 ```python
@@ -36,4 +36,4 @@ class Solution:
                 ans = delete
         return ans
 
-```
+```

generated/doc-contributors.json

@@ -1,8 +1,8 @@
 {
   "repo": "InvolutionHell/involutionhell",
-  "generatedAt": "2025-11-11T03:04:30.448Z",
+  "generatedAt": "2025-11-12T03:05:31.078Z",
   "docsDir": "app/docs",
-  "totalDocs": 109,
+  "totalDocs": 110,
   "results": [
     {
       "docId": "ue27z7z95yzw3lhhfj7nit1c",
@@ -2034,6 +2034,23 @@
         }
       ]
     },
+    {
+      "docId": "bsf0yz1zrmlz7masrdmq8fq6",
+      "path": "app/docs/CommunityShare/Leetcode/1653. 使字符串平衡的最少删除次数_translated.md",
+      "contributorStats": {
+        "114939201": 1
+      },
+      "contributors": [
+        {
+          "githubId": "114939201",
+          "contributions": 1,
+          "lastContributedAt": "2025-11-12T03:00:17.000Z",
+          "login": "longsizhuo",
+          "avatarUrl": "https://avatars.githubusercontent.com/u/114939201?v=4",
+          "htmlUrl": "https://github.com/longsizhuo"
+        }
+      ]
+    },
     {
       "docId": "clx9mmqqvxipdfamqciuo146",
       "path": "app/docs/CommunityShare/Leetcode/2679.矩阵中的和_translated.md",
@@ -2055,13 +2072,13 @@
       "docId": "ryp6s59uwc10w2dywgs6f66h",
       "path": "app/docs/CommunityShare/Leetcode/80_translated.md",
       "contributorStats": {
-        "114939201": 1
+        "114939201": 2
       },
       "contributors": [
         {
           "githubId": "114939201",
-          "contributions": 1,
-          "lastContributedAt": "2025-11-11T03:00:03.000Z",
+          "contributions": 2,
+          "lastContributedAt": "2025-11-11T03:04:31.000Z",
           "login": "longsizhuo",
           "avatarUrl": "https://avatars.githubusercontent.com/u/114939201?v=4",
           "htmlUrl": "https://github.com/longsizhuo"