LeetCode-Solution/LeetCode151.cpp at main · nfpranta/LeetCode-Solution · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
class Solution
{
public:
    string reverseWords(string s)
    {
        int pos = 0;
        string word = "";
        string ans = "";
        int n = s.size();
        bool flag = false;
        for (int i = 0; i < n; i++)
        {
            if (s[i] != ' ')
            {
                if (flag)
                {
                    ans = " " + ans;
                    flag = false;
                }
                word += s[i];
            }
            else if (word.size() > 0)
            {
                ans = word + ans;
                word = "";
                flag = true;
            }
        }
        if (word.size() > 0)
        {
            ans = word + ans;
            word = "";
        }
        return ans;
    }
};