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/restore-the-array.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5.3K\", \"totalSubmission\": \"12.5K\", \"totalAcceptedRaw\": 5297, \"totalSubmissionRaw\": 12523, \"acRate\": \"42.3%\"}",
"stats": "{\"totalAccepted\": \"5.3K\", \"totalSubmission\": \"12.5K\", \"totalAcceptedRaw\": 5298, \"totalSubmissionRaw\": 12524, \"acRate\": \"42.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."