<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) {
        int i=0;
        int n=s.size();
        string ans;
        string result;
        while(i<n)
        {
            while(i<n && s[i]==' ')
            {
                i++;
            }
            int j=i+1;
            while(j<n && s[j]!=' ')
            {
                j++;
            }
            ans=s.substr(i,j-i);
            reverse(ans.begin(),ans.end());
            if(result.size()==0)
            {
                result=ans;
            }
            else
            {
                result=result+' '+ans;
            }
            i=j+1;
        }
        return result;
        
    }
};
169355