<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 reverseWords(string s) {
        s+=' ';
        vector<string>v;
        while(s.find(' ')!= string ::npos){
            int pos=s.find(' ');
            string aux=s.substr(0,pos);
            v.push_back(aux);
            s=s.substr(pos+1,s.length()-pos+1);
        }
        vector<string>v1;
        stack<char>st;
        for(int i=0;i<v.size();i++){
            for(int j=0;j<v[i].length();j++){
                st.push(v[i][j]);

            }
            string aux1="";
            int n=st.size();
            for(int j=0;j<n;j++){
                aux1+=st.top();
                st.pop();
            }
            
            v1.push_back(aux1);

        }
        string res=v1[0];
        for(int i=1;i<v1.size();i++){
            res+=" ";
            res+=v1[i];
            
        }
        return res;
        
    }
};
120286