-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathletcode_1859.py
More file actions
51 lines (32 loc) · 1.33 KB
/
letcode_1859.py
File metadata and controls
51 lines (32 loc) · 1.33 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
# 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.
# 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.
s = "Myself2 Me1 I4 and3"
output =""
dicti = {}
for i in s.split(): dicti[int(i[-1:])] = i[:-1]
for x in range(len(dicti)): output += dicti[x+1] + " "
print(output.strip())
print(sorted(dicti))
# en funcion
# def out (s):
# output =""
# dicti = {}
# for i in s.split(): dicti[int(i[-1:])] = i[:-1]
# for x in range(len(dicti)): output += dicti[x+1] + " "
# return output.strip()
# print(out(s))