일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- REVERSE
- Array
- sort numbers
- translate
- 1859
- a
- 청년전세대출
- Ethiopian veterans
- 청년무직자전세대출
- 1880
- 청년전용전세대출
- LeetCode
- Sort
- maketrans
- 1913
- leetcode832
- 청년맞춤형전세대출
- Python
- revers
- 버팀목청년전세대출
- 중기청대출
- leetcode1880
- Kagnew
- 청년전세
- Ethiopian Veterans of the Korean War
- Sorting
- string
- python3
- javascript
- Today
- Total
Momentary Comfort
[LeetCode][Python] | 1859. Sorting the Sentence 본문
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.
Constraints:
- 2 <= s.length <= 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:
dic = {}
for i in s.split():
dic[i[-1]] = i[:-1]
final = []
for num, word in sorted(dic.items()):
final.append(word)
return " ".join(final)
# (runtime / memory)
# 24 ms / 14.3 MB
class Solution:
def sortSentence(self, s: str) -> str:
dic = {}
for i in s.split():
dic[i[-1]] = i[:-1]
final = [word for num, word in sorted(dic.items())]
return " ".join(final)
# (runtime / memory)
# 28 ms / 14.4 MB
class Solution:
def sortSentence(self, s: str) -> str:
words = s[::-1].split()
result = [word[1:][::-1] for word in sorted(words)]
return ' '.join(result)
# (runtime / memory)
# 32 ms / 14.1 MB
Click the link if you want to check a solution using JavaScript: https://momentarycomfort.tistory.com/683
[LeetCode][JavaScript] | 1859. Sorting the Sentence
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 b..
momentarycomfort.tistory.com
'Algorithm' 카테고리의 다른 글
[LeetCode][JavaScript] | 1913. Maximum Product Difference Between Two Pairs (0) | 2021.07.10 |
---|---|
[LeetCode][JavaScript] | 1859. Sorting the Sentence (0) | 2021.06.22 |
[LeetCode][JavaScript] | 1832. Check if the Sentence Is Pangram (0) | 2021.06.17 |
[LeetCode][Python] | 1832. Check if the Sentence Is Pangram (0) | 2021.06.17 |