last-substring-in-lexicographical-order

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given a string <code>s</code>, return the last substring of <code>s</code> in lexicographical order.

&nbsp;
Example 1:

<pre>
Input: s = &quot;abab&quot;
Output: &quot;bab&quot;
Explanation: The substrings are [&quot;a&quot;, &quot;ab&quot;, &quot;aba&quot;, &quot;abab&quot;, &quot;b&quot;, &quot;ba&quot;, &quot;bab&quot;]. The lexicographically maximum substring is &quot;bab&quot;.
</pre>

Example 2:

<pre>
Input: s = &quot;leetcode&quot;
Output: &quot;tcode&quot;
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 4 * 105</code></li>
	<li><code>s</code> contains only lowercase English letters.</li>
</ul>

lastSubstring

Last Substring in Lexicographical Order

Find the Lexicographically Largest String From the Box I

find-the-lexicographically-largest-string-from-the-box-i

从盒子中找出字典序最大的字符串 I

Two Pointers

String

给你一个字符串&nbsp;<code>s</code>&nbsp;，找出它的所有子串并按字典序排列，返回排在最后的那个子串。

&nbsp;

示例 1：

<pre>
输入：s = "abab"
输出："bab"
解释：我们可以找出 7 个子串 ["a", "ab", "aba", "abab", "b", "ba", "bab"]。按字典序排在最后的子串是 "bab"。
</pre>

示例&nbsp;2：

<pre>
输入：s = "leetcode"
输出："tcode"
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= s.length &lt;= 4 * 105</code></li>
	<li><code>s</code> 仅含有小写英文字符。</li>
</ul>