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

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/paint-house-iii.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 548,
"likes": 564,
"dislikes": 29,
"isLiked": null,
"similarQuestions": "[]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"15.1K\", \"totalSubmission\": \"29.9K\", \"totalAcceptedRaw\": 15140, \"totalSubmissionRaw\": 29852, \"acRate\": \"50.7%\"}",
"stats": "{\"totalAccepted\": \"15.6K\", \"totalSubmission\": \"30.7K\", \"totalAcceptedRaw\": 15603, \"totalSubmissionRaw\": 30687, \"acRate\": \"50.8%\"}",
"hints": [
"Use Dynamic programming.",
"Define dp[i][j][k] as the minimum cost where we have k neighborhoods in the first i houses and the i-th house is painted with the color j."