Leetcode: Reverse Words in a String

最新推荐文章于 2024-01-04 11:20:32 发布

ayst123

最新推荐文章于 2024-01-04 11:20:32 发布

阅读量276

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.csdn.net/ayst123/article/details/48415075

leetcode 专栏收录该内容

216 篇文章

订阅专栏

本文提供了一种方法，用于给定输入字符串时，按单词反转字符串，同时处理空格和特殊字符，确保最终结果中没有多余的空白和正确的单词顺序。

Question

Given an input string, reverse the string word by word.

For example,
Given s = “the sky is blue”,
return “blue is sky the”.

Update (2015-02-12):
For C programmers: Try to solve it in-place in O(1) space.

click to show clarification.

Clarification:
What constitutes a word?
A sequence of non-space characters constitutes a word.
Could the input string contain leading or trailing spaces?
Yes. However, your reversed string should not contain leading or trailing spaces.
How about multiple spaces between two words?
Reduce them to a single space in the reversed string.
Hide Tags String
Hide Similar Problems (M) Reverse Words in a String II

Solution

class Solution(object):
    def reverseWords(self, s):
        """
        :type s: str
        :rtype: str
        """

        return ' '.join(s.split()[::-1])