Class Solution
-
- All Implemented Interfaces:
public final class Solution1859 - Sorting the Sentence.
Easy
A sentence 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.
A sentence can be shuffled by appending the 1-indexed word position to each word then rearranging the words in the sentence.
For example, the sentence
"This is a sentence"can be shuffled as"sentence4 a3 is2 This1"or"is2 sentence4 This1 a3".
Given a shuffled sentence
scontaining no more than9words, reconstruct and return the original sentence.Example 1:
Input: s = "is2 sentence4 This1 a3"
Output: "This is a sentence"
Explanation: Sort the words in s to their original positions "This1 is2 a3 sentence4", then remove the numbers.
Example 2:
Input: s = "Myself2 Me1 I4 and3"
Output: "Me Myself and I"
Explanation: Sort the words in s to their original positions "Me1 Myself2 and3 I4", then remove the numbers.
Constraints:
2 <= s.length <= 200sconsists of lowercase and uppercase English letters, spaces, and digits from1to9.The number of words in
sis between1and9.The words in
sare separated by a single space.scontains no leading or trailing spaces.
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final StringsortSentence(String s)-
-
Method Detail
-
sortSentence
final String sortSentence(String s)
-
-
-
-