coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/last-substring-in-lexicographical-order.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 433,
"dislikes": 406,
"likes": 438,
"dislikes": 408,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "\"abab\"\n\"leetcode\"",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"29.3K\", \"totalSubmission\": \"82.1K\", \"totalAcceptedRaw\": 29271, \"totalSubmissionRaw\": 82096, \"acRate\": \"35.7%\"}",
"stats": "{\"totalAccepted\": \"29.4K\", \"totalSubmission\": \"82.7K\", \"totalAcceptedRaw\": 29425, \"totalSubmissionRaw\": 82660, \"acRate\": \"35.6%\"}",
"hints": [
"Assume that the answer is a sub-string from index i to j. If you add the character at index j+1 you get a better answer.",
"The answer is always a suffix of the given string.",