2022-03-27 20:37:52 +08:00
< p > Given a string < code > s< / code > , return < em > the last substring of< / em > < code > s< / code > < em > in lexicographical order< / em > .< / p >
< p > < / p >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 1:< / strong > < / p >
2022-03-27 20:37:52 +08:00
< pre >
< strong > Input:< / strong > s = " abab"
< strong > Output:< / strong > " bab"
< strong > Explanation:< / strong > The substrings are [" a" , " ab" , " aba" , " abab" , " b" , " ba" , " bab" ]. The lexicographically maximum substring is " bab" .
< / pre >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 2:< / strong > < / p >
2022-03-27 20:37:52 +08:00
< pre >
< strong > Input:< / strong > s = " leetcode"
< strong > Output:< / strong > " tcode"
< / pre >
< p > < / p >
< p > < strong > Constraints:< / strong > < / p >
< ul >
< li > < code > 1 < = s.length < = 4 * 10< sup > 5< / sup > < / code > < / li >
< li > < code > s< / code > contains only lowercase English letters.< / li >
< / ul >
