Leetcode:Reverse Words in a String

字符串单词反转

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

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

0 ·

CC 4.0 BY-SA版权

文章标签：

#Reverse Words in a S

本文介绍了一种算法，用于将输入字符串中的单词顺序进行反转，并详细解释了两种实现方法：一种使用C++，另一种使用Java。文章强调了处理空格的重要性，确保结果中单词之间只保留单个空格。

Reverse Words in a String

:

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.

实现代码：

class Solution {
public:
    void reverseWords(string &s) {

        string res = "";
        if(s.length()==0) return;
        int i=s.length()-1,end=i, start=i;
        while(i>=0){
            if(s[i--]!=' ') {
                start=i+1;
                if((i>=0 && s[i]==' ')||i<0) {
                    res+=s.substr(start,end-start+1)+" ";
                    end = start-1;
                }
            }
            else end--;
        }
        s=res.substr(0,res.length()-1);
    }
};

或者利用java的spilt函数：

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);
    }
}