coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +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/lexicographically-smallest-beautiful-string.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"12K\", \"totalAcceptedRaw\": 4346, \"totalSubmissionRaw\": 11985, \"acRate\": \"36.3%\"}",
"stats": "{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"12K\", \"totalAcceptedRaw\": 4347, \"totalSubmissionRaw\": 11990, \"acRate\": \"36.3%\"}",
"hints": [
"If the string does not contain any palindromic substrings of lengths 2 and 3, then the string does not contain any palindromic substrings at all.",
"Iterate from right to left and if it is possible to increase character at index i without creating any palindromic substrings of lengths 2 and 3, then increase it.",