leetcode 151: Reverse Words in a String

最新推荐文章于 2020-04-13 20:01:17 发布

mikefan1991

最新推荐文章于 2020-04-13 20:01:17 发布

阅读量242

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/mikefan1991/article/details/47846965

版权

leetcode 专栏收录该内容

201 篇文章 0 订阅

订阅专栏

Use a stack to delete all redundant spaces in the original string. After pushing all characters into the stack, all words are in a reversed state. While popping, reverse every word and append them to the final result.

class Solution {
public:
    void reverseWords(string &s) {
        int i;
        for(i=0;i<s.size();i++)
            if(s[i]!=' ')
                break;
        s=s.substr(i);
        for(i=s.size()-1;i>=0;i--)
            if(s[i]!=' ')
                break;
        s=s.substr(0,i+1);
        stack<char> st;
        for(int i=0;i<s.size();i++)
        {
            if(s[i]==' '&&st.top()==' ')
                continue;
            st.push(s[i]);
        }
        string res;
        string word;
        while(!st.empty())
        {
            if(st.top()!=' ')
                word+=st.top();
            else
            {
                reverse(word.begin(),word.end());
                res+=word+' ';
                word.clear();
            }
            st.pop();
        }
        reverse(word.begin(),word.end());
        res+=word;
        s=res;
    }
};