算法学习三----句子单词反转

题目要求：反转句子中单词的顺序

题目：输入一个英文句子，反转句子中单词的顺序，但单词内字符的顺序不变。句子中单词以空格符隔开。为简单起见，标点符号和普通字符一样处理。

例如输入“I am a student.”，则输出“student. a am I”

此算法可以结合栈的数据结构实现，分割每个单词，一个个放入栈中，然后再一个个弹出即可。

下面是此算法的伪代码：

void ReverseSentence(const string &s)
     get s's size

     define a singleString to store each word

     define a stack to store each single word

     for i <- 0 to s.size
          if s[i] is space
               if the space is last word's end
               then push a new word to sentence
               reset singleString
          else add char to singleString

    //end for

     if last word has not push into sentence
     then push it into sentence

     while sentence is not empty

          output the word and one space

          pop one value from sentence

    //end while

C++实现

//get s's size
	int len = s.size();

	//define a singleString to store each word
	string singleString = "";

	//define a stack to store each single word
	stack<string> sentence;

	//for i <- 0 to s.size
	for(int i = 0; i != s.size(); ++i)
	{
		//if s[i] is space
		if(s[i] == ' ')
		{
			//if the space is last word's end
			if(singleString.size() > 0)
			{
				//then push a new word to sentence
				sentence.push(singleString);
				
				//reset singleString
				singleString = "";
			}
		}
		else
		{
			//else add char to singleString
			singleString += s[i];
		}
	}

	//if last word has not push into sentence
	if(singleString.size() != 0)
	{
		//then push it into sentence
		sentence.push(singleString);
	}

	//while sentence is not empty
	while(!sentence.empty())
	{
		//output the word and one space
		cout << sentence.top() << " ";

		//pop one value from sentence
		sentence.pop();
	}
	cout << endl;