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

Leetcode: Reverse Words in a String

时间:2015-01-10 23:47:02      阅读:474      评论:0      收藏:0      [点我收藏+]

标签:leetcode   string   

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

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

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) {
        stack<string> words;
		int fpos= 0, spos = 0;
		while((spos = s.find(' ', fpos)) != string::npos){
			if(spos > fpos)
				words.push(string(s, fpos, spos-fpos));
			fpos = spos + 1;
		}
		if(fpos < s.size())
			words.push(string(s, fpos));
		s = "";
		while(!words.empty()){
			s += words.top();
			words.pop();
			if(!words.empty())
				s += " ";
		}
    }
};




Leetcode: Reverse Words in a String

标签:leetcode   string   

原文地址:http://blog.csdn.net/doc_sgl/article/details/42590341

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