README_EN.md

1859. Sorting the Sentence

中文文档

Description

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.

<li>For example, the sentence <code>&quot;This is a sentence&quot;</code> can be shuffled as <code>&quot;sentence4 a3 is2 This1&quot;</code> or <code>&quot;is2 sentence4 This1 a3&quot;</code>.</li>

Given a shuffled sentence s containing no more than 9 words, 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:

<li><code>2 &lt;= s.length &lt;= 200</code></li>

<li><code>s</code> consists of lowercase and uppercase English letters, spaces, and digits from <code>1</code> to <code>9</code>.</li>

<li>The number of words in <code>s</code> is between <code>1</code> and <code>9</code>.</li>

<li>The words in <code>s</code> are separated by a single space.</li>

<li><code>s</code> contains no leading or trailing spaces.</li>

Solutions

Python3

class Solution:
    def sortSentence(self, s: str) -> str:
        words = s.split()
        ans = [None] * len(words)
        for w in words:
            i = int(w[-1]) - 1
            ans[i] = w[:-1]
        return ' '.join(ans)

Java

class Solution {
    public String sortSentence(String s) {
        String[] words = s.split(" ");
        String[] ans = new String[words.length];
        for (String w : words) {
            int i = w.charAt(w.length() - 1) - '1';
            ans[i] = w.substring(0, w.length() - 1);
        }
        return String.join(" ", ans);
    }
}

C++

class Solution {
public:
    string sortSentence(string s) {
        istringstream is(s);
        string t;
        vector<string> words;
        while (is >> t) words.push_back(t);
        vector<string> res(words.size());
        for (auto& w : words) {
            int i = w[w.size() - 1] - '1';
            res[i] = w.substr(0, w.size() - 1);
        }
        string ans;
        for (auto& w : res) {
            ans += w + " ";
        }
        ans.pop_back();
        return ans;
    }
};

Go

func sortSentence(s string) string {
	words := strings.Split(s, " ")
	ans := make([]string, len(words))
	for _, w := range words {
		i := w[len(w)-1] - '1'
		ans[i] = w[:len(w)-1]
	}
	return strings.Join(ans, " ")
}

JavaScript

/**
 * @param {string} s
 * @return {string}
 */
var sortSentence = function (s) {
    const words = s.split(' ');
    const ans = new Array(words.length);
    for (const w of words) {
        const i = w.charCodeAt(w.length - 1) - '1'.charCodeAt(0);
        ans[i] = w.slice(0, w.length - 1);
    }
    return ans.join(' ');
};

TypeScript

function sortSentence(s: string): string {
    const words = s.split(' ');
    const ans = new Array(words.length);
    for (const w of words) {
        const i = w.charCodeAt(w.length - 1) - '1'.charCodeAt(0);
        ans[i] = w.slice(0, w.length - 1);
    }
    return ans.join(' ');
}

...