mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-06 16:01:41 +08:00
update
This commit is contained in:
37
leetcode/problem/sorting-the-sentence.html
Normal file
37
leetcode/problem/sorting-the-sentence.html
Normal file
@@ -0,0 +1,37 @@
|
||||
<p>A <strong>sentence</strong> is a list of words that are separated by a single space with no leading or trailing spaces. Each word consists of lowercase and uppercase English letters.</p>
|
||||
|
||||
|
||||
|
||||
<p>A sentence can be <strong>shuffled</strong> by appending the <strong>1-indexed word position</strong> to each word then rearranging the words in the sentence.</p>
|
||||
|
||||
|
||||
|
||||
<ul>
|
||||
|
||||
<li>For example, the sentence <code>"This is a sentence"</code> can be shuffled as <code>"sentence4 a3 is2 This1"</code> or <code>"is2 sentence4 This1 a3"</code>.</li>
|
||||
|
||||
</ul>
|
||||
|
||||
|
||||
|
||||
<p>Given a <strong>shuffled sentence</strong> <code>s</code> containing no more than <code>9</code> words, reconstruct and return <em>the original sentence</em>.</p>
|
||||
|
||||
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>Example 1:</strong></p>
|
||||
|
||||
|
||||
|
||||
<pre>
|
||||
|
||||
<strong>Input:</strong> s = "is2 sentence4 This1 a3"
|
||||
|
||||
<strong>Output:</strong> "This is a sentence"
|
||||
|
||||
<strong>Explanation:</strong> Sort the words in s to their original positions "This1 is2 a3 sentence4", then remove the numbers.
|
||||
|
||||
</pre>
|
||||
|
||||
|
Reference in New Issue
Block a user