【Leetcode长征系列】Reverse Words in a String

原题：

Given an input string, reverse the string word by word.

For example,
Given s = "the sky is blue",
return "blue is sky the".

Clarification:

• What constitutes a word?
  A sequence of non-space characters constitutes a word.
• Could the input string contain leading or trailing spaces?
  Yes. However, your reversed string should not contain leading or trailing spaces.
• How about multiple spaces between two words?
  Reduce them to a single space in the reversed string.

思路：最初的想法是开辟新string，从尾部开始一个一个判断赋值给新字符串。需要注意处理连续空格的情况。但是这样会超内存。

代码：

class Solution {
public:
    void reverseWords(string &s) {
        string ns="";
        int i=s.length()-1; 
        int count = 0;
        
        while(i>=0){
            while( i>=0 && s[i]==' ')
                i--;
            if(i<0) break;
            if(ns.length()!=0)
                ns.push_back(' ');
            string temp;
            for( ; i>=0 && s[i]!=' '; i-- )
                temp.push_back(s[i]);
            reverse(temp.begin(),temp.end());
            ns.append(temp);
        }
        s = ns;
    }
};

问题1：注意审题，不是全部翻转，而是把句子中的词语进行反转。

2. 参考了网上代码，用意整个while循环很巧妙，整个逻辑过程很精简。

3. 不熟悉string属性，它也有很多类似stl的用法，很有用也。