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

Author: longsizhuo

app/docs/CommunityShare/Leetcode/[213]打家劫舍 II_translated.md

@@ -1,19 +1,21 @@
 ---
 title: 213.Hiccup II
-date: '2024.01.01 0:00'
+date: "2024.01.01 0:00"
 tags:
   - Python
   - answer
   - Array
   - Dynamic planning
 abbrlink: 85beb0bf
+docId: rv6egbynttb4mt1n0412bue0
 ---
-# topic：
 
+# topic：
 
 [topic链接](https://leetcode-cn.com/problems/house-robber-ii/)
 
 # Thought：
+
 这一次终于懂一点Dynamic planning了，The first is the youngest problem，I first thought it was to consider where to start，Start from the first or the second one（这刚好是和Hiccup1Difference）。
 但实际上最小子问题还是和Hiccup1Same：Whether to rob the current house。
 First we set one`dp`Array，`dp[i]`Indicate robbery to the first`i`The maximum return when a house。
@@ -39,4 +41,4 @@ class Solution:
             return ans
         # 打劫First一家，或者First二家开始
         return max(rob1(nums[:-1]), rob1(nums[1:])) if len(nums) != 1 else nums[0]
-```
+```

generated/doc-contributors.json

@@ -1,8 +1,8 @@
 {
   "repo": "InvolutionHell/involutionhell",
-  "generatedAt": "2025-11-13T03:06:20.335Z",
+  "generatedAt": "2025-11-14T03:05:54.670Z",
   "docsDir": "app/docs",
-  "totalDocs": 111,
+  "totalDocs": 112,
   "results": [
     {
       "docId": "ue27z7z95yzw3lhhfj7nit1c",
@@ -2017,6 +2017,23 @@
         }
       ]
     },
+    {
+      "docId": "rv6egbynttb4mt1n0412bue0",
+      "path": "app/docs/CommunityShare/Leetcode/[213]打家劫舍 II_translated.md",
+      "contributorStats": {
+        "114939201": 1
+      },
+      "contributors": [
+        {
+          "githubId": "114939201",
+          "contributions": 1,
+          "lastContributedAt": "2025-11-14T03:00:17.000Z",
+          "login": "longsizhuo",
+          "avatarUrl": "https://avatars.githubusercontent.com/u/114939201?v=4",
+          "htmlUrl": "https://github.com/longsizhuo"
+        }
+      ]
+    },
     {
       "docId": "p8igr19xfxnuyo2lpngnr6fg",
       "path": "app/docs/CommunityShare/Leetcode/1234. 替换子串得到平衡字符串_translated.md",
@@ -2055,13 +2072,13 @@
       "docId": "a6inw303oslb7i5tcqj5xxx4",
       "path": "app/docs/CommunityShare/Leetcode/2270. Number of Ways to Split Array.md",
       "contributorStats": {
-        "114939201": 1
+        "114939201": 2
       },
       "contributors": [
         {
           "githubId": "114939201",
-          "contributions": 1,
-          "lastContributedAt": "2025-11-13T03:00:08.000Z",
+          "contributions": 2,
+          "lastContributedAt": "2025-11-13T03:06:21.000Z",
           "login": "longsizhuo",
           "avatarUrl": "https://avatars.githubusercontent.com/u/114939201?v=4",
           "htmlUrl": "https://github.com/longsizhuo"