<p>Given a string <code>s</code>, reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;Let&#39;s take LeetCode contest&quot;
<strong>Output:</strong> &quot;s&#39;teL ekat edoCteeL tsetnoc&quot;
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;Mr Ding&quot;
<strong>Output:</strong> &quot;rM gniD&quot;
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 5 * 10<sup>4</sup></code></li>
	<li><code>s</code> contains printable <strong>ASCII</strong> characters.</li>
	<li><code>s</code> does not contain any leading or trailing spaces.</li>
	<li>There is <strong>at least one</strong> word in <code>s</code>.</li>
	<li>All the words in <code>s</code> are separated by a single space.</li>
</ul>

class Solution {
public:
    string removeSpaces(string s){
        int start = s.find_first_not_of(" ");
        if(start == string::npos){
            return "";
        }
        int end = s.find_last_not_of(" ");

        string new_str = s.substr(start, end - start + 1);
        return new_str;
    }
    string reverseWords(string s) {
        istringstream iss(removeSpaces(s));
        vector<string> words;
        string word;
        string char_reversed;

        while(iss >> word){
            words.push_back(word);
        }

        for(int i = 0; i < words.size(); i++){
            string c_word = words[i];
            int s = 0;
            int e = c_word.size() - 1;

            while(s<e){
                swap(c_word[s], c_word[e]);
                s++;
                e--;
            }
            
            char_reversed += c_word;

            if(i < words.size() - 1){
                char_reversed += ' ';
            }
        }


        return char_reversed;
    }
};
18878