给定一个字符串,你需要反转字符串中每个单词的字符顺序,同时仍保留空格和单词的初始顺序。
给定一个字符串,你需要反转字符串中每个单词的字符顺序,同时仍保留空格和单词的初始顺序。
示例 1:
输入: “Let’s take LeetCode contest”
输出: “s’teL ekat edoCteeL tsetnoc”
注意:在字符串中,每个单词由单个空格分隔,并且字符串中不会有任何额外的空格。
取一个index:
class Solution:
def reverseWords(self, s):
"""
:type s: str
:rtype: str
"""
index, s = 0, list(s)
for i, char in enumerate(s):
if char == ' ':
s[index:i] = s[index:i][::-1]
index = i+1
if i == len(s)-1:
s[index:] = s[index:][::-1]
return ''.join(s)
根据空格分词后翻转每个词,最后join:
class Solution:
def reverseWords(self, s):
"""
:type s: str
:rtype: str
"""
words = s.split(' ')
for i in range(len(words)):
words[i] = words[i][::-1]
return ' '.join(words)