coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51:41 +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/unique-paths-ii.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"432.1K\", \"totalSubmission\": \"1M\", \"totalAcceptedRaw\": 432067, \"totalSubmissionRaw\": 1049124, \"acRate\": \"41.2%\"}",
"stats": "{\"totalAccepted\": \"432.1K\", \"totalSubmission\": \"1M\", \"totalAcceptedRaw\": 432129, \"totalSubmissionRaw\": 1049306, \"acRate\": \"41.2%\"}",
"hints": [
"Use dynamic programming since, from each cell, you can move to the right or down.",
"assume dp[i][j] is the number of unique paths to reach (i, j). dp[i][j] = dp[i][j -1] + dp[i - 1][j]. Be careful when you encounter an obstacle. set its value in dp to 0."