coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/originData/house-robber-ii.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"674.6K\", \"totalSubmission\": \"1.6M\", \"totalAcceptedRaw\": 674613, \"totalSubmissionRaw\": 1619892, \"acRate\": \"41.6%\"}",
"stats": "{\"totalAccepted\": \"674.7K\", \"totalSubmission\": \"1.6M\", \"totalAcceptedRaw\": 674698, \"totalSubmissionRaw\": 1620078, \"acRate\": \"41.6%\"}",
"hints": [
"Since House[1] and House[n] are adjacent, they cannot be robbed together. Therefore, the problem becomes to rob either House[1]-House[n-1] or House[2]-House[n], depending on which choice offers more money. Now the problem has degenerated to the <a href =\"https://leetcode.com/problems/house-robber/description/\">House Robber</a>, which is already been solved."
],