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

Author: longsizhuo

app/docs/CommunityShare/Leetcode/2309兼具大小写的最好英文字母_translated.md

@@ -1,6 +1,8 @@
 ---
-title: 2309. The best English letters with both appropriates and lowercases One question daily
-date: '2024.01.01 0:00'
+title: >-
+  2309. The best English letters with both appropriates and lowercases One
+  question daily
+date: "2024.01.01 0:00"
 tags:
   - - Python
   - - answer
@@ -9,6 +11,7 @@ tags:
   - - Hash table
   - - C++
 abbrlink: b4953d62
+docId: mc2rjsq7syibclikyhomsbft
 ---
 
 [2309. The best English letters with both appropriates and lowercases](https://leetcode.cn/problems/greatest-english-letter-in-upper-and-lower-case/description/)
@@ -17,18 +20,17 @@ abbrlink: b4953d62
 
 1. Hash table：The first thing to think of the question is to solve it with a dictionary。But find that you can directly traverse the alphabet，fromZStart looking for，See if the applause exists，Just return directly。
 
-*Running time exceeds99.9%*
-2. Bit operation：We can use two integers mask1 and mask2 Record string separately s 中出现的小写字母and大写字母，in mask1 First i 
+_Running time exceeds99.9%_ 2. Bit operation：We can use two integers mask1 and mask2 Record string separately s 中出现的小写字母and大写字母，in mask1 First i
 Position representation i Does a lowercase letter appear，and mask2 First i Position representation i Whether an uppercase letter appears。
 
 Then we will mask1 and mask2 Perform and calculate，The results obtained mask First i Position representation i Whether the lethals of the letter appear at the same time。
 
 As long as you get mask The highest level of binary representation 1 s position，Convert it to the corresponding capital letter。If all binary positions are not 1，Explain that there is no letter that appears at the same time,，Return to an empty string。
 
->author：ylb
-Link：https://leetcode.cn/problems/greatest-english-letter-in-upper-and-lower-case/solutions/2077636/by-lcbin-zbg0/
-source：Deduction（LeetCode）
-著作权归author所有。商业转载请联系author获得授权，Non -commercial reprint Please indicate the source。
+> author：ylb
+> Link：https://leetcode.cn/problems/greatest-english-letter-in-upper-and-lower-case/solutions/2077636/by-lcbin-zbg0/
+> source：Deduction（LeetCode）
+> 著作权归author所有。商业转载请联系author获得授权，Non -commercial reprint Please indicate the source。
 
 # Code：
 
@@ -40,7 +42,8 @@ class Solution:
                 return chr(i)
         return ""
 ```
-```C++  Hash table
+
+```C++ Hash table
 class Solution {
 public:
     string greatestLetter(string s) {
@@ -54,7 +57,8 @@ public:
     }
 };
 ```
-```python  Bit operation
+
+```python Bit operation
 class Solution:
     def greatestLetter(self, s: str) -> str:
         # We can use two integers mask1 and mask2
@@ -69,4 +73,3 @@ class Solution:
         mask = mask1 & mask2
         return chr(mask.bit_length() - 1 + ord("A")) if mask else ""
 ```
-

generated/doc-contributors.json

@@ -1,8 +1,8 @@
 {
   "repo": "InvolutionHell/involutionhell",
-  "generatedAt": "2025-11-27T03:05:27.753Z",
+  "generatedAt": "2025-11-28T03:06:17.491Z",
   "docsDir": "app/docs",
-  "totalDocs": 125,
+  "totalDocs": 126,
   "results": [
     {
       "docId": "ue27z7z95yzw3lhhfj7nit1c",
@@ -2204,6 +2204,23 @@
         }
       ]
     },
+    {
+      "docId": "mc2rjsq7syibclikyhomsbft",
+      "path": "app/docs/CommunityShare/Leetcode/2309兼具大小写的最好英文字母_translated.md",
+      "contributorStats": {
+        "114939201": 1
+      },
+      "contributors": [
+        {
+          "githubId": "114939201",
+          "contributions": 1,
+          "lastContributedAt": "2025-11-28T03:00:11.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",
@@ -2276,13 +2293,13 @@
       "docId": "s0cadbu09dgu54q0zxttkx7z",
       "path": "app/docs/CommunityShare/Leetcode/9021_TUT_3_25T1.md",
       "contributorStats": {
-        "114939201": 1
+        "114939201": 2
       },
       "contributors": [
         {
           "githubId": "114939201",
-          "contributions": 1,
-          "lastContributedAt": "2025-11-27T03:00:16.000Z",
+          "contributions": 2,
+          "lastContributedAt": "2025-11-27T03:05:29.000Z",
           "login": "longsizhuo",
           "avatarUrl": "https://avatars.githubusercontent.com/u/114939201?v=4",
           "htmlUrl": "https://github.com/longsizhuo"