Reverse word in a string [leetcode]_given an input string, reverse the string word by -CSDN博客

本文介绍了一种使用栈来实现字符串中单词的反转算法。通过遍历输入字符串并利用栈的数据结构特性，可以有效地按单词反转字符串，并确保结果中没有多余的空格。

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

/*
Reverse Words in a String Total Accepted: 35825 Total Submissions: 256704 My Submissions
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.
*/

使用栈来存放中间的结果

需要特别注意的是如果s = " hello wordld "

对于字符串的末尾要特备注意处理

class Solution
{
public:
	void reverseWords(string &s)
	{
		stack <string> word_stack;
		string word = "";
		for(int i = 0;i < s.length();i ++)
		{
			while(s[i] == ' '&& i < s.length())
			{
				i++;
			}
			while(s[i] != ' ' && i < s.length())
			{
				word += s[i];
				i++;
			}
			if(word != "")//避免字符串末尾出现空格的情况
			word_stack.push(word);
			word = "";
		}
		s = "";
		while(!word_stack.empty())
		{
			s += word_stack.top();
			word_stack.pop();
			if(!word_stack.empty())
				s += ' ';
		}
	}
};