coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-21 13:06:47 +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

2
leetcode-cn/originData/restore-the-array.json
View File

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.1K\", \"totalSubmission\": \"7.5K\", \"totalAcceptedRaw\": 3093, \"totalSubmissionRaw\": 7487, \"acRate\": \"41.3%\"}",
"stats": "{\"totalAccepted\": \"3.1K\", \"totalSubmission\": \"7.6K\", \"totalAcceptedRaw\": 3141, \"totalSubmissionRaw\": 7599, \"acRate\": \"41.3%\"}",
"hints": [
"Use dynamic programming. Build an array dp where dp[i] is the number of ways you can divide the string starting from index i to the end.",
"Keep in mind that the answer is modulo 10^9 + 7 and take the mod for each operation."