update

leetcode-cn/originData/last-substring-in-lexicographical-order.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给你一个字符串&nbsp;<code>s</code>&nbsp;，找出它的所有子串并按字典序排列，返回排在最后的那个子串。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre>\n<strong>输入：</strong>s = \"abab\"\n<strong>输出：</strong>\"bab\"\n<strong>解释：</strong>我们可以找出 7 个子串 [\"a\", \"ab\", \"aba\", \"abab\", \"b\", \"ba\", \"bab\"]。按字典序排在最后的子串是 \"bab\"。\n</pre>\n\n<p><strong>示例&nbsp;2：</strong></p>\n\n<pre>\n<strong>输入：</strong>s = \"leetcode\"\n<strong>输出：</strong>\"tcode\"\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>1 &lt;= s.length &lt;= 4 * 10<sup>5</sup></code></li>\n\t<li><code>s</code> 仅含有小写英文字符。</li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Hard",
-            "likes": 59,
+            "likes": 60,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -143,7 +143,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"6.4K\", \"totalSubmission\": \"24K\", \"totalAcceptedRaw\": 6443, \"totalSubmissionRaw\": 24029, \"acRate\": \"26.8%\"}",
+            "stats": "{\"totalAccepted\": \"6.6K\", \"totalSubmission\": \"24.5K\", \"totalAcceptedRaw\": 6569, \"totalSubmissionRaw\": 24455, \"acRate\": \"26.9%\"}",
             "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.",