coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/originData/number-of-ways-to-paint-n-3-grid.json
View File

@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"24K\", \"totalSubmission\": \"38.9K\", \"totalAcceptedRaw\": 24024, \"totalSubmissionRaw\": 38857, \"acRate\": \"61.8%\"}",
"stats": "{\"totalAccepted\": \"24.1K\", \"totalSubmission\": \"38.9K\", \"totalAcceptedRaw\": 24066, \"totalSubmissionRaw\": 38925, \"acRate\": \"61.8%\"}",
"hints": [
"We will use Dynamic programming approach. we will try all possible configuration.",
"Let dp[idx][prev1col][prev2col][prev3col] be the number of ways to color the rows of the grid from idx to n-1 keeping in mind that the previous row (idx - 1) has colors prev1col, prev2col and prev3col. Build the dp array to get the answer."