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

Author: longsizhuo

app/docs/CommunityShare/Leetcode/[1545]找出第 N 个二进制字符串中的第 K 位.md

@@ -6,6 +6,7 @@ tags:
   - answer
   - Math
   - String
+docId: zuoplhoodv7tzfgku0pwzi6w
 ---
 
 # 题目

app/docs/CommunityShare/Leetcode/index.mdx

@@ -1,6 +1,7 @@
 ---
 title: Leetcode 题解汇总
 description: 这里收集了社区分享的所有 Leetcode 刷题笔记和题解。
+docId: aslw60tfyzxqga598pt4ociu
 ---
 
 import { source } from "@/lib/source";

generated/doc-contributors.json

@@ -1,8 +1,8 @@
 {
   "repo": "InvolutionHell/involutionhell",
-  "generatedAt": "2026-03-04T14:17:25.549Z",
+  "generatedAt": "2026-03-09T17:47:42.725Z",
   "docsDir": "app/docs",
-  "totalDocs": 146,
+  "totalDocs": 148,
   "results": [
     {
       "docId": "ue27z7z95yzw3lhhfj7nit1c",
@@ -2068,6 +2068,23 @@
         }
       ]
     },
+    {
+      "docId": "zuoplhoodv7tzfgku0pwzi6w",
+      "path": "app/docs/CommunityShare/Leetcode/[1545]找出第 N 个二进制字符串中的第 K 位.md",
+      "contributorStats": {
+        "114939201": 1
+      },
+      "contributors": [
+        {
+          "githubId": "114939201",
+          "contributions": 1,
+          "lastContributedAt": "2026-03-09T17:41:04.000Z",
+          "login": "longsizhuo",
+          "avatarUrl": "https://avatars.githubusercontent.com/u/114939201?v=4",
+          "htmlUrl": "https://github.com/longsizhuo"
+        }
+      ]
+    },
     {
       "docId": "rv6egbynttb4mt1n0412bue0",
       "path": "app/docs/CommunityShare/Leetcode/[213]打家劫舍 II_translated.md",
@@ -2706,6 +2723,23 @@
         }
       ]
     },
+    {
+      "docId": "aslw60tfyzxqga598pt4ociu",
+      "path": "app/docs/CommunityShare/Leetcode/index.mdx",
+      "contributorStats": {
+        "114939201": 1
+      },
+      "contributors": [
+        {
+          "githubId": "114939201",
+          "contributions": 1,
+          "lastContributedAt": "2026-03-09T17:41:04.000Z",
+          "login": "longsizhuo",
+          "avatarUrl": "https://avatars.githubusercontent.com/u/114939201?v=4",
+          "htmlUrl": "https://github.com/longsizhuo"
+        }
+      ]
+    },
     {
       "docId": "qfvqmc1exp066falnsg97c5m",
       "path": "app/docs/CommunityShare/Leetcode/剑指 Offer II 021. 删除链表的倒数第 n 个结点_translated.md",