coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +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

4
leetcode/originData/restore-the-array.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 346,
"likes": 358,
"dislikes": 14,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Number of Ways to Separate Numbers\", \"titleSlug\": \"number-of-ways-to-separate-numbers\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"11.8K\", \"totalSubmission\": \"31.2K\", \"totalAcceptedRaw\": 11815, \"totalSubmissionRaw\": 31239, \"acRate\": \"37.8%\"}",
"stats": "{\"totalAccepted\": \"12K\", \"totalSubmission\": \"31.7K\", \"totalAcceptedRaw\": 12027, \"totalSubmissionRaw\": 31699, \"acRate\": \"37.9%\"}",
"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."