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

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given a string <code>word</code>, and an integer <code>numFriends</code>.

Alice is organizing a game for her <code>numFriends</code> friends. There are multiple rounds in the game, where in each round:

<ul>
	<li><code>word</code> is split into <code>numFriends</code> non-empty strings, such that no previous round has had the exact same split.</li>
	<li>All the split words are put into a box.</li>
</ul>

Find the lexicographically largest string from the box after all the rounds are finished.

&nbsp;
Example 1:

<div class="example-block">
Input: word = &quot;dbca&quot;, numFriends = 2

Output: &quot;dbc&quot;

Explanation:&nbsp;

All possible splits are:

<ul>
	<li><code>&quot;d&quot;</code> and <code>&quot;bca&quot;</code>.</li>
	<li><code>&quot;db&quot;</code> and <code>&quot;ca&quot;</code>.</li>
	<li><code>&quot;dbc&quot;</code> and <code>&quot;a&quot;</code>.</li>
</ul>
</div>

Example 2:

<div class="example-block">
Input: word = &quot;gggg&quot;, numFriends = 4

Output: &quot;g&quot;

Explanation:&nbsp;

The only possible split is: <code>&quot;g&quot;</code>, <code>&quot;g&quot;</code>, <code>&quot;g&quot;</code>, and <code>&quot;g&quot;</code>.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= word.length &lt;= 5&nbsp;* 103</code></li>
	<li><code>word</code> consists only of lowercase English letters.</li>
	<li><code>1 &lt;= numFriends &lt;= word.length</code></li>
</ul>

answerString

Find the Lexicographically Largest String From the Box I

Last Substring in Lexicographical Order

last-substring-in-lexicographical-order

按字典序排在最后的子串

Construct the Lexicographically Largest Valid Sequence

construct-the-lexicographically-largest-valid-sequence

构建字典序最大的可行序列

Two Pointers

String

Enumeration

给你一个字符串 <code>word</code> 和一个整数 <code>numFriends</code>。

Alice 正在为她的 <code>numFriends</code> 位朋友组织一个游戏。游戏分为多个回合，在每一回合中：

<ul>
	<li><code>word</code> 被分割成 <code>numFriends</code> 个&nbsp;非空&nbsp;字符串，且该分割方式与之前的任意回合所采用的都 不完全相同&nbsp;。</li>
	<li>所有分割出的字符串都会被放入一个盒子中。</li>
</ul>

在所有回合结束后，找出盒子中&nbsp;字典序最大的&nbsp;字符串。

&nbsp;

示例 1：

<div class="example-block">
输入: word = "dbca", numFriends = 2

输出: "dbc"

解释:&nbsp;

所有可能的分割方式为：

<ul>
	<li><code>"d"</code> 和 <code>"bca"</code>。</li>
	<li><code>"db"</code> 和 <code>"ca"</code>。</li>
	<li><code>"dbc"</code> 和 <code>"a"</code>。</li>
</ul>
</div>

示例 2：

<div class="example-block">
输入: word = "gggg", numFriends = 4

输出: "g"

解释:&nbsp;

唯一可能的分割方式为：<code>"g"</code>, <code>"g"</code>, <code>"g"</code>, 和 <code>"g"</code>。
</div>

&nbsp;

提示:

<ul>
	<li><code>1 &lt;= word.length &lt;= 5&nbsp;* 103</code></li>
	<li><code>word</code> 仅由小写英文字母组成。</li>
	<li><code>1 &lt;= numFriends &lt;= word.length</code></li>
</ul>