https://leetcode.cn/problems/reverse-words-in-a-string-iii/
给定一个字符串 s ,你需要反转字符串中每个单词的字符顺序,同时仍保留空格和单词的初始顺序。
示例 1:
输入:s = “Let’s take LeetCode contest”
输出:“s’teL ekat edoCteeL tsetnoc”
class Solution:
def reverseWords(self, s: str) -> str:
lst = s.split()[::-1]
return ' '.join(lst)[::-1]