LeetCode Reverse Words in a String

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

kgduu

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

阅读量601

点赞数

CC 4.0 BY-SA版权

分类专栏： OJ

本文链接：https://blog.youkuaiyun.com/xiexingshishu/article/details/25647889

OJ 专栏收录该内容

986 篇文章

订阅专栏

本文介绍了一种算法，该算法能够接收一个字符串作为输入，并按单词为单位进行反转，例如将输入theskyisblue转换为blueisskythe。文章详细解释了如何处理连续空格及前后空白字符。

摘要生成于 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".

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.

public class Solution {
    public String reverseWords(String s) {
        s = s.trim();
        String[] strArr = s.split("[ ]+");
        StringBuilder sb = new StringBuilder();
        
        for (int i = strArr.length - 1; i >= 0; i--) {
            sb.append(strArr[i]);
            
            if (i != 0) sb.append(" ");
        }
        
        return sb.toString();
    }
}