coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-08 08:51:42 +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-cn/originData/paint-house-iii.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"18.1K\", \"totalSubmission\": \"27.3K\", \"totalAcceptedRaw\": 18060, \"totalSubmissionRaw\": 27295, \"acRate\": \"66.2%\"}",
"stats": "{\"totalAccepted\": \"18.1K\", \"totalSubmission\": \"27.3K\", \"totalAcceptedRaw\": 18061, \"totalSubmissionRaw\": 27296, \"acRate\": \"66.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."