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 s containing no more than 9 words, reconstruct and return the original sentence.

&nbsp;
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.


&nbsp;
Constraints:


	2 &lt;= s.length &lt;= 200
	s consists of lowercase and uppercase English letters, spaces, and digits from 1 to 9.
	The number of words in s is between 1 and 9.
	The words in s are separated by a single space.
	s contains no leading or trailing spaces.

class Solution:
    def sortSentence(self, s: str) -> str:

        x = s.split()
        dic = {}
        for i in x :
            dic[i[-1]] = i[:-1]
        return ' '.join([dic[j] for j in sorted(dic)])
class Solution {
    public String sortSentence(String s) {
        String []res=new String[s.split(" ").length];
        for(String st:s.split(" ")){
            res[st.charAt(st.length()-1)-'1']=st.substring(0,st.length()-1);
        }
        return String.join(" ",res);
    }
}
class Solution {
public:
    string sortSentence(string s) 
    {
        stringstream words(s); 
        string word;
        pair<int, string> m;
        vector<pair<int, string> > sent;
        
        //SECTION 1
        while(words>>word)
        {
            int len = word.size();
            int i = int(word[len-1]) - 48;
            sent.push_back(make_pair(i, word.substr(0, len-1)));
        }
        
        //SECTION 2
        sort(sent.begin(), sent.end());
        
        //SECTION 3
        string ans = "";
        int len = sent.size();
        for(int i=0; i<len; i++)
        {
            ans += sent[i].second;
            if(i!= len-1)
                ans += " ";
        }
        
        return ans;
    }
};
var sortSentence = function(s) {
    let sortingS = s.split(' ').sort((a,b) => a.substr(-1) - b.substr(-1));
    slicingS = sortingS.map(word => word.slice(0, -1));
    return slicingS.join(' ');
};
Sorting the Sentence