coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41: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/originData/restore-the-array.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"56.4K\", \"totalSubmission\": \"116.8K\", \"totalAcceptedRaw\": 56375, \"totalSubmissionRaw\": 116785, \"acRate\": \"48.3%\"}",
"stats": "{\"totalAccepted\": \"56.4K\", \"totalSubmission\": \"116.8K\", \"totalAcceptedRaw\": 56377, \"totalSubmissionRaw\": 116789, \"acRate\": \"48.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."