码迷,mamicode.com
首页 > 其他好文 > 详细

leetcode[151]Reverse Words in a String

时间:2015-02-09 00:43:53      阅读:211      评论: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.
class Solution {
public:
void reverseWords(string &s) {
    if(s.empty())return;
    string tmp="";
    string str="";
    int i=0;
    while(i<s.length())
    {
        while(s[i]== &&i<s.length())i++;
        if(s[i]!= &&i<s.length())
        {
            while(s[i]!= &&i<s.length())tmp=s[i++]+tmp;
            str+=(tmp+ );
            tmp="";
        }
    }
    reverse(str.begin(),str.end());
    int n=str[0]== ?1:0;
    s=str.substr(n,str.size());
    return;
}
};

 

leetcode[151]Reverse Words in a String

标签:

原文地址:http://www.cnblogs.com/Vae98Scilence/p/4280723.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!