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/number-of-beautiful-partitions.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9.1K\", \"totalSubmission\": \"29.9K\", \"totalAcceptedRaw\": 9118, \"totalSubmissionRaw\": 29872, \"acRate\": \"30.5%\"}",
"stats": "{\"totalAccepted\": \"9.1K\", \"totalSubmission\": \"29.9K\", \"totalAcceptedRaw\": 9122, \"totalSubmissionRaw\": 29885, \"acRate\": \"30.5%\"}",
"hints": [
"Try using a greedy approach where you take as many digits as possible from the left of the string for each partition.",
"You can also use a dynamic programming approach, let an array dp where dp[i] is the solution of the problem for the prefix of the string ending at index i, the answer of the problem will be dp[n-1]. What are the transitions of this dp?"