Leetcode: Reverse Words in a String

本文介绍了如何通过去除首尾空格并反转单词顺序来处理输入字符串,详细步骤包括去除首尾空格、遍历字符串并按空格分割单词、反转单词顺序并用空格连接结果。

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

Problem: 

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.




Idea:

Main Steps:

step 1  remove leading spaces and trailing spaces.

step 2 traverse the string from the end, for characters in between of the same two white spaces, append them to the same StringBuilder in order,  then reverse the StringBuilder and concat it to the result,  and do not forget to add a white space to separate each pair of adjacent words. 

Note:  In each while statement,  start <= end should be in front of other conditions to avoid "StringIndexOutOfBoundsException: String index out of range: -1".


My solution:

public class Solution {
    public String reverseWords(String s) {
        String result = "";
        if (s == null || s.length() == 0) {
            return "";
        }
        int start = 0;
        int end = s.length() - 1;
       
       // remove leading spaces 
        while (start <= end && s.charAt(start) == ' ') {
                start++;
        } 
        
        // remove trailing spaces
        while (start <= end && s.charAt(end) == ' ') {
                end--;
        }
        if (start > end) {
            return "";
        }
        
        
        while (start <= end) {
            StringBuilder sb = new StringBuilder();
            while (s.charAt(end) != ' ') {
                sb.append(s.charAt(end));
                end--;
            }
            result = result + sb.reverse().toString() + " ";
            while (start <= end && s.charAt(end) == ' ') {
                end--;
            }
        }
        return result.substring(0,result.length() - 1);
    }
}


Other solution copied from the website which is better:

using String[] and split(" ").


public class Solution {
    public String reverseWords(String s) {
        if (s == null || s.length() == 0) {
            return "";
        }

        String[] array = s.split(" ");
        StringBuilder sb = new StringBuilder();

        for (int i = array.length - 1; i >= 0; --i) {
            if (!array[i].equals("")) {
                sb.append(array[i]).append(" ");
            }
        }

        //remove the last " "
        return sb.length() == 0 ? "" : sb.substring(0, sb.length() - 1);
    }
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值