coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-22 05:26:46 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/paint-house-iii.json
View File

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"16K\", \"totalSubmission\": \"23.9K\", \"totalAcceptedRaw\": 16049, \"totalSubmissionRaw\": 23896, \"acRate\": \"67.2%\"}",
"stats": "{\"totalAccepted\": \"16.1K\", \"totalSubmission\": \"23.9K\", \"totalAcceptedRaw\": 16052, \"totalSubmissionRaw\": 23900, \"acRate\": \"67.2%\"}",
"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."