coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 16:01: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/minimum-insertion-steps-to-make-a-string-palindrome.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"147.7K\", \"totalSubmission\": \"211.1K\", \"totalAcceptedRaw\": 147744, \"totalSubmissionRaw\": 211140, \"acRate\": \"70.0%\"}",
"stats": "{\"totalAccepted\": \"147.8K\", \"totalSubmission\": \"211.2K\", \"totalAcceptedRaw\": 147762, \"totalSubmissionRaw\": 211164, \"acRate\": \"70.0%\"}",
"hints": [
"Is dynamic programming suitable for this problem ?",
"If we know the longest palindromic sub-sequence is x and the length of the string is n then, what is the answer to this problem? It is n - x as we need n - x insertions to make the remaining characters also palindrome."