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/shortest-and-lexicographically-smallest-beautiful-string.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"21K\", \"totalSubmission\": \"56.3K\", \"totalAcceptedRaw\": 21035, \"totalSubmissionRaw\": 56349, \"acRate\": \"37.3%\"}",
"stats": "{\"totalAccepted\": \"21.1K\", \"totalSubmission\": \"56.4K\", \"totalAcceptedRaw\": 21053, \"totalSubmissionRaw\": 56381, \"acRate\": \"37.3%\"}",
"hints": [
"Notice that if we consider that index <code>i</code> is the leftmost index of a beautiful substring, it has only one candidate <code>j</code>, such that <code>s[i:j]</code> is beautiful and shortest too.",
"We can iterate over all possibilities of leftmost index <code>i</code> take <code>s[i:j]</code> and compare with the shortest and the lexicographically smallest beautiful string we could get before index <code>i</code>."