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-cn/originData/maximum-deletions-on-a-string.json
View File

@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"7.2K\", \"totalSubmission\": \"15K\", \"totalAcceptedRaw\": 7172, \"totalSubmissionRaw\": 14957, \"acRate\": \"48.0%\"}",
"stats": "{\"totalAccepted\": \"7.2K\", \"totalSubmission\": \"15K\", \"totalAcceptedRaw\": 7173, \"totalSubmissionRaw\": 14958, \"acRate\": \"48.0%\"}",
"hints": [
"We can use dynamic programming to find the answer. Create a 0-indexed dp array where dp[i] represents the maximum number of moves needed to remove the first i + 1 letters from s.",
"What should we do if there is an i where it is impossible to remove the first i + 1 letters?",