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/maximum-number-of-non-overlapping-palindrome-substrings.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"13K\", \"totalSubmission\": \"33.3K\", \"totalAcceptedRaw\": 12965, \"totalSubmissionRaw\": 33260, \"acRate\": \"39.0%\"}",
"stats": "{\"totalAccepted\": \"13K\", \"totalSubmission\": \"33.3K\", \"totalAcceptedRaw\": 12980, \"totalSubmissionRaw\": 33284, \"acRate\": \"39.0%\"}",
"hints": [
"Try to use dynamic programming to solve the problem.",
"let dp[i] be the answer for the prefix s[0…i].",