Reverse Words in a String

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

原创最新推荐文章于 2024-01-04 11:20:32 发布 · 4.4k 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 同时被 2 个专栏收录

62 篇文章

订阅专栏

C/C++

60 篇文章

订阅专栏

本文介绍了一种算法，用于将输入的字符串按单词翻转，同时处理空格问题，确保输出字符串中单词顺序正确且多余空格被清理。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

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.

翻转字符串，但是字符串中的单词字母顺序不变，还要注意空格哦。Python代码如下：

class Solution:
    # @param s, a string
    # @return a string
    def reverseWords(self, s):
        if len(s) == 0:
            return ""

        ret = ""
        start = False
        begin = end = 0
        start = False

        for i in range(len(s)):
            if s[len(s) - i - 1] != '' and s[len(s) - i - 1] != ' ' and end == 0:
                end = len(s) -i

            if end != 0 and (s[len(s) - i - 1] == ' ' or i == (len(s) - 1)):
                begin = len(s) -i
                if not start:
                    if i == (len(s) - 1) and s[begin -1] != ' ':
                        begin -= 1
                    ret += s[begin:end]
                    start = True
                else:
                    if i == (len(s) - 1) and s[begin -1] != ' ':
                        begin -= 1
                    ret += " " + s[begin:end]
                begin = 0
                end = 0


        return ret