LeetCode C++ 151. Reverse Words in a String 【字符串】中等·

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

Example 1:

Input: "the sky is blue"
Output: "blue is sky the"

Example 2:

Input: "  hello world!  "
Output: "world! hello"
Explanation: Your reversed string should not contain leading or trailing spaces.

Example 3:

Input: "a good   example"
Output: "example good a"
Explanation: You need to reduce multiple spaces between two words to a single space in the reversed string.

Note:

• A word is defined as a sequence of non-space characters.
• Input string may contain leading or trailing spaces. However, your reversed string should not contain leading or trailing spaces.
• You need to reduce multiple spaces between two words to a single space in the reversed string.

Follow up: For C programmers, try to solve it in-place in O(1) extra space.

题意：以单词为单位逆转一个字符串。注意：一个单词被定义为非空格的字符序列。输入字符串可以包含多个前导或者后缀空格，但是结果字符串不应该存在这些空格。另外，结果中两个单词间的空格必须只有一个。

---

思路1：分割字符串形成一个词序列，然后从后往前串接出结果字符串。

代码：

class Solution {
   
public:
    void split(const string &s, vector<string> &tokens, char delim=' ') {
   
        size_t beginPos = s.