题目描述:
给定一个字符串,你需要反转字符串中每个单词的字符顺序,同时仍保留空格和单词的初始顺序。
示例:
输入: "Let's take LeetCode contest"
输出: "s'teL ekat edoCteeL tsetnoc"
代码如下:
class Solution(object):
def reverseWords(self, s):
"""
:type s: str
:rtype: str
"""
num = s.split()
s = ''
for each in num:
s += (each[::-1]+' ')
return s[:-1]