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

Author: longsizhuo

app/docs/CommunityShare/Leetcode/2299强密码检验器II_translated.md

@@ -1,15 +1,14 @@
 ---
 title: One question daily 2299. Code inspection device II
-date: '2024.01.01 0:00'
+date: "2024.01.01 0:00"
 tags:
   - - Python
   - - answer
   - - Bit operation
 abbrlink: 7ded25bb
+docId: fxn6bn619g3a9l98l9vggpg1
 ---
 
-
-
 Excess when executing100%User，What can I say about this question，But one**Bit operation**Knowledge point
 
 # My code：
@@ -35,14 +34,17 @@ class Solution:
             return True
         return False
 ```
+
 # Bit operation代码：
+
 method one：simulation + Bit operation
 
 According to the description of the topic，我们可以simulation检查密码是否满足题目要求的过程。
 
 first，We check whether the length of the password is less than 8，in the case of，Then return false。
 
 Next，We use a mask mask To record whether the password contains a lowercase letter、uppercase letter、Numbers and special characters。We traverse the password，Like a character every time，First determine whether it is the same as the previous character，in the case of，Then return false。Then，Update mask according to the type of character mask。at last，We check the mask mask Whether it is 15，in the case of，Then return true，否Then return false。
+
 ```python
 class Solution:
     def strongPasswordCheckerII(self, password: str) -> bool:

generated/doc-contributors.json

@@ -1,8 +1,8 @@
 {
   "repo": "InvolutionHell/involutionhell",
-  "generatedAt": "2025-11-20T03:05:03.577Z",
+  "generatedAt": "2025-11-21T03:05:06.818Z",
   "docsDir": "app/docs",
-  "totalDocs": 119,
+  "totalDocs": 120,
   "results": [
     {
       "docId": "ue27z7z95yzw3lhhfj7nit1c",
@@ -2153,6 +2153,23 @@
         }
       ]
     },
+    {
+      "docId": "fxn6bn619g3a9l98l9vggpg1",
+      "path": "app/docs/CommunityShare/Leetcode/2299强密码检验器II_translated.md",
+      "contributorStats": {
+        "114939201": 1
+      },
+      "contributors": [
+        {
+          "githubId": "114939201",
+          "contributions": 1,
+          "lastContributedAt": "2025-11-21T03:00:16.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",
@@ -2208,13 +2225,13 @@
       "docId": "one7va4e0hvbq1eqhm6ww2kd",
       "path": "app/docs/CommunityShare/Leetcode/brief_alternate 作业帮忙_translated.md",
       "contributorStats": {
-        "114939201": 1
+        "114939201": 2
       },
       "contributors": [
         {
           "githubId": "114939201",
-          "contributions": 1,
-          "lastContributedAt": "2025-11-20T03:00:04.000Z",
+          "contributions": 2,
+          "lastContributedAt": "2025-11-20T03:05:05.000Z",
           "login": "longsizhuo",
           "avatarUrl": "https://avatars.githubusercontent.com/u/114939201?v=4",
           "htmlUrl": "https://github.com/longsizhuo"