LKJZ58-1-翻转单词顺序

LKJZ58-1-翻转单词顺序

https://leetcode-cn.com/problems/fan-zhuan-dan-ci-shun-xu-lcof/

---

双指针逐个翻转单词，最后再翻转整个字符串

class Solution {
public:
    //双指针先逐个翻转单词，最后再翻转整个字符串
    string reverseWords(string s) {
        int k=0;//k是补空格和赋值用的
        for(int left=0;left<s.size();left++){
            int right=left;
            //去掉单词的前导空格
            while(right<s.size()&&s[right]==' '){
                right++;
            }
            //保证最后不会s[k++]=' '导致多加一个空格
            if(right==s.size()){
                break;
            }
            left=right;
            //找出单词区间
            while(right<s.size()&&s[right]!=' '){
                right++;
            }
            //翻转单词
            reverse(s.begin()+left,s.begin()+right);
            //补空格，第一个单词不用补
            if(k!=0){
                s[k]=' ';
                k++;
            }
            //将翻转后的单词重新赋值给s的前k个字符，k为单词长度
            while(left<right){
                s[k++]=s[left++];
            }
        }
        //擦除多余空格
        s.erase(s.begin()+k,s.end());
        //翻转整个字符串
        reverse(s.begin(),s.end());
        return s;
    }
};