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

Author: longsizhuo

app/docs/CommunityShare/Leetcode/2335. 装满杯子需要的最短总时长_translated.md

@@ -1,24 +1,25 @@
 ---
 title: 2335. The shortest total time to be filled with a cup One question daily
-date: '2024.01.01 0:00'
+date: "2024.01.01 0:00"
 tags:
   - - Python
   - - answer
   - - dp
   - - One question daily
   - - golang
 abbrlink: 4400daa1
+docId: hiqhki2z4v6oy0jstrcs7im0
 ---
-# topic：
 
+# topic：
 
 [2335. The shortest total time to be filled with a cup.md](https://leetcode.cn/problems/minimum-amount-of-time-to-fill-cups/description/)
 
 # Thought：
 
 1. This question is very simple，但是我好像没用贪心的Thought。Look at the second test case and find it found，In fact, the minimum number of seconds is to avoid a certain number as much as possible0。
    So keep sorting，Always operate the two largest numbers。This sending can also be used for DoriamountCase，But because of sorting，I don't know if it can be used for a large number。
-	Look atylbBig，和我一样但是Big细节处理得很好，Two fewer judgments than me，Then it seems that the classification discussion method below may be a solution to the difficult situation。
+   Look atylbBig，和我一样但是Big细节处理得很好，Two fewer judgments than me，Then it seems that the classification discussion method below may be a solution to the difficult situation。
 2. mathematical method？Sort the number of drinks from small to large，Set the quantity x，y，z。Our goal is to match the different drinks as much as possible。
    like$x+y<=z$，The answer isz。like反之，Then set$t=(x+y-z)$，t是偶数The answer is
    $ \frac{t−1}{2} +z$Plus one
@@ -41,6 +42,7 @@ class Solution:
             amount.sort()
         return count
 ```
+
 ```go
 import "sort"
 
@@ -56,4 +58,4 @@ func fillCups(amount []int) int {
 	}
 	return ans
 }
-```
+```

generated/doc-contributors.json

@@ -1,8 +1,8 @@
 {
   "repo": "InvolutionHell/involutionhell",
-  "generatedAt": "2025-11-28T03:06:17.491Z",
+  "generatedAt": "2025-11-29T03:05:48.113Z",
   "docsDir": "app/docs",
-  "totalDocs": 126,
+  "totalDocs": 127,
   "results": [
     {
       "docId": "ue27z7z95yzw3lhhfj7nit1c",
@@ -2207,14 +2207,31 @@
     {
       "docId": "mc2rjsq7syibclikyhomsbft",
       "path": "app/docs/CommunityShare/Leetcode/2309兼具大小写的最好英文字母_translated.md",
+      "contributorStats": {
+        "114939201": 2
+      },
+      "contributors": [
+        {
+          "githubId": "114939201",
+          "contributions": 2,
+          "lastContributedAt": "2025-11-28T03:06:18.000Z",
+          "login": "longsizhuo",
+          "avatarUrl": "https://avatars.githubusercontent.com/u/114939201?v=4",
+          "htmlUrl": "https://github.com/longsizhuo"
+        }
+      ]
+    },
+    {
+      "docId": "hiqhki2z4v6oy0jstrcs7im0",
+      "path": "app/docs/CommunityShare/Leetcode/2335. 装满杯子需要的最短总时长_translated.md",
       "contributorStats": {
         "114939201": 1
       },
       "contributors": [
         {
           "githubId": "114939201",
           "contributions": 1,
-          "lastContributedAt": "2025-11-28T03:00:11.000Z",
+          "lastContributedAt": "2025-11-29T03:00:32.000Z",
           "login": "longsizhuo",
           "avatarUrl": "https://avatars.githubusercontent.com/u/114939201?v=4",
           "htmlUrl": "https://github.com/longsizhuo"