20170914_翻转句子

20170914_翻转句子

//逆置句子_好未来
/*题目描述
将一句话的单词进行倒置，标点不倒置。比如 I like beijing. 经过函数后变为：beijing. like I
输入描述:
每个测试输入包含1个测试用例： I like beijing. 输入用例长度不超过100
输出描述:
依次输出倒置之后的字符串,以空格分割
示例1
输入
I like beijing.
输出
beijing. like I
*/

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<numeric>
#include<functional>
using namespace std;

class Solution
{
public:
	void Reverse(string &sentence, int begin, int end)
	{
		for(int i=begin, j=end; i<j; ++i, --j)
			swap(sentence[i], sentence[j]);
	}
public:
	void ReverseSentence(string &sentence)
	{
		int senLen=sentence.size();
		if(senLen<1)
			return;
		//整个句子翻转
		Reverse(sentence, 0, senLen-1);
		//cout<<sentence<<endl;
		//翻转每个单词
		int pBegin=0;
		int pEnd=0;
		while(sentence[pBegin]!='\0')
		{
			if(sentence[pBegin]==' ')
			{
				++pBegin;
				++pEnd;
			}
			else if(sentence[pEnd]==' ' || sentence[pEnd]=='\0')
			{
				--pEnd;
				Reverse(sentence, pBegin, pEnd);
				pBegin=++pEnd;
			}
			else
				++pEnd;
		}
		cout<<sentence<<endl;
	}
};

int main(void)
{
	string sentence;
	class Solution object;
	while(getline(cin, sentence))	//输入带空格的字符串句子
	{
		object.ReverseSentence(sentence);
	}

	system("pause");
	return 0;
}