[LeetCode]Reverse Words in a String

最新推荐文章于 2017-09-23 19:08:14 发布

Tim_WT

最新推荐文章于 2017-09-23 19:08:14 发布

阅读量572

点赞数

分类专栏： LeetCode Excercise 算法C++描述文章标签： reverse string

本文链接：https://blog.youkuaiyun.com/tingwang1122/article/details/24559581

版权

算法C++描述同时被 2 个专栏收录

33 篇文章

订阅专栏

LeetCode Excercise

16 篇文章

订阅专栏

本文介绍了一种算法，用于将输入字符串中的单词顺序进行反转。通过使用堆栈数据结构，该算法可以有效地实现单词级别的反转，同时处理多个空格及前后空白字符。

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

Answer:

class Solution {
public:
    void reverseWords(string &s) {
        if(!s.empty())
        {
            stack<string> sta;
            istringstream f(s);
            string str;
//            while(getline(f, str, ' '))
//            {
//               if (str > " ")
//                {
//                    sta.push(str);
//               }
//            }
            while(f >> str)
            {
              sta.push(str);
            }
            string temp = "";
            bool em = true;
            while (!sta.empty())
            {
                if (!em)
                {
                    temp += " ";
                }
                temp += sta.top();
                sta.pop();
                em = false;
            }
            s = temp;
        }
    }
};