首页 > 其他 > 详细

Reverse Words in a String

时间:2014-10-25 21:26:55      阅读:327      评论:0      收藏:0      [点我收藏+]

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

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

click to show clarification.

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.
分析:细节实现题,注意leading和trailing space。代码如下:
class Solution {
public:
    void reverseWords(string &s) {
        int n = s.length();
        if(n == 0) return;
        vector<string> pool;
        int i = 0;
        while(s[i] ==  )i++;
        string tmp;
        for(int j = i; j < n; j++){
            if(s[j] !=  ){
                tmp.push_back(s[j]);
                if(j == n-1)
                    pool.push_back(tmp);
            }
            else{
                if(s[j-1] !=  ){
                    pool.push_back(tmp);
                    tmp.clear();
                }
            }
        }
        s.clear();
        for(auto a = pool.rbegin(); a != pool.rend(); a++){
            s.append(*a);
            s.push_back( );
        }
        if(s.length() != 0)
            s.pop_back();
    }
};

 

Reverse Words in a String

原文:http://www.cnblogs.com/Kai-Xing/p/4050881.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!