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

leetcode 151. Reverse Words in a String

时间:2015-01-11 12:12:04      阅读:128      评论: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.
 1 void reverseWords(string &s)
 2     {
 3         string sret;
 4         int i = s.length() - 1;
 5         
 6         while (i >= 0)
 7         {
 8             while (i >= 0 && s[i] ==  ) 
 9                 i--;
10             if (i < 0) 
11                 break;
12             if (!sret.empty()) 
13                 sret.push_back( );
14 
15             string stmp;
16             while (i >= 0 && s[i] !=  ) 
17             {    
18                 stmp.push_back(s[i]);
19                 i--;
20             }
21             reverse(stmp.begin(), stmp.end());
22             sret.append(stmp);
23         }
24         s = sret;
25     }

 

leetcode 151. Reverse Words in a String

标签:

原文地址:http://www.cnblogs.com/ym65536/p/4216291.html

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