Reverse Words in a String[LeetCode]

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

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

0 ·

CC 4.0 BY-SA版权

文章标签：

#Reverse Words in a S

LeetCode 专栏收录该内容

10 篇文章

订阅专栏

本文介绍了一种在LeetCode上的字符串题目解决方法，通过逐词反转来实现字符串的整体反转，并且特别关注了非单词字符如空格的处理方式。文章提供了一个详细的C++实现案例，包括去除多余空格和规范单词间空格的步骤。

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

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.

LeetCode上第一题，没注意 Clarification，浪费了些时间：各种“ ” “ a ” “ a” “a ” “ a ” "the sky is blue"等都需要考虑

void reverseWords(string &s) {
		if(s == "")return;

		string s1  = "";
		string temp = "";
		size_t i = 0;
                //去掉前面的空格
		while(s[i] == ' ')i++;
		while(i < s.length()){
			if(s[i] != ' '){
				temp += s[i];
			}else{
				if(s1 == ""){
					s1 = temp;
					temp = "";
				}else{
					if(temp!= "")
						s1 = temp + " " + s1;
					temp = "";
				}
			}
			i++;
		}
		if(temp != ""){
			if(s1 != ""){
				s1 = temp + " " + s1;
			}else{
				s1 = temp;
			}
		}
		s = s1;
｝