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

Author: longsizhuo

app/docs/CommunityShare/Leetcode/Counting Stars-Inter-Uni Programming Contest.md

@@ -6,6 +6,7 @@ tags:
   - Python
   - Binary Search
 abbrlink: a29b0a05
+docId: fostlzqqx6l10qz1egd8dw5m
 ---
 
 # Description:
@@ -20,13 +21,14 @@ https://interunia.unswcpmsoc.com/task/Counting%20Stars/
 - The positions of fixed stars remain unchanged.
 
 Therefore, we need to maintain a list of the **last y-coordinate of the current chain**.
+
 1. **Sort the points**: Sort them by increasing x coordinates.
 2. **Initialization**: Create an empty list `last_y` to store the last y-coordinate of each chain.
 3. **Traverse the set of points**:
-    - For each point (x, y):
-        - Use `bisect_right` to find the first position in `last_y` that is greater than the current y.
-        - If the index is less than the length of `last_y`, it means there is an existing chain that can accommodate the current point, so we update the last y-coordinate of that chain to the current y.
-        - If the index is equal to the length of `last_y`, it means no suitable chain is found, so we need to create a new chain and add the current y to `last_y`.
+   - For each point (x, y):
+     - Use `bisect_right` to find the first position in `last_y` that is greater than the current y.
+     - If the index is less than the length of `last_y`, it means there is an existing chain that can accommodate the current point, so we update the last y-coordinate of that chain to the current y.
+     - If the index is equal to the length of `last_y`, it means no suitable chain is found, so we need to create a new chain and add the current y to `last_y`.
 
 # Code:
 
@@ -53,4 +55,4 @@ for x, y in stars:
         last_y.append(y)  # 创建新的链
 
 print(len(last_y))
-```
+```

generated/doc-contributors.json

@@ -1,8 +1,8 @@
 {
   "repo": "InvolutionHell/involutionhell",
-  "generatedAt": "2025-11-14T03:05:54.670Z",
+  "generatedAt": "2025-11-15T03:07:05.492Z",
   "docsDir": "app/docs",
-  "totalDocs": 112,
+  "totalDocs": 113,
   "results": [
     {
       "docId": "ue27z7z95yzw3lhhfj7nit1c",
@@ -2021,13 +2021,13 @@
       "docId": "rv6egbynttb4mt1n0412bue0",
       "path": "app/docs/CommunityShare/Leetcode/[213]打家劫舍 II_translated.md",
       "contributorStats": {
-        "114939201": 1
+        "114939201": 2
       },
       "contributors": [
         {
           "githubId": "114939201",
-          "contributions": 1,
-          "lastContributedAt": "2025-11-14T03:00:17.000Z",
+          "contributions": 2,
+          "lastContributedAt": "2025-11-14T03:05:55.000Z",
           "login": "longsizhuo",
           "avatarUrl": "https://avatars.githubusercontent.com/u/114939201?v=4",
           "htmlUrl": "https://github.com/longsizhuo"
@@ -2119,6 +2119,23 @@
         }
       ]
     },
+    {
+      "docId": "fostlzqqx6l10qz1egd8dw5m",
+      "path": "app/docs/CommunityShare/Leetcode/Counting Stars-Inter-Uni Programming Contest.md",
+      "contributorStats": {
+        "114939201": 1
+      },
+      "contributors": [
+        {
+          "githubId": "114939201",
+          "contributions": 1,
+          "lastContributedAt": "2025-11-15T03:00:49.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",