Text Reverse题解

从周六请假到周三回学校被作业ddl和栈支配的一周。
做学校的作业发现有一题用栈简单好多，那就用来练习栈了

                               **Text Reverse**

Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Description
Ignatius likes to write words in reverse way. Given a single line of text which is written by Ignatius, you should reverse all the words and then output them.

Input
The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
Each test case contains a single line with several words. There will be at most 1000 characters in a line.

Output
For each test case, you should output the text which is processed.

Sample Input
3
olleh !dlrow
m’I morf .udh
I ekil .mca

Sample Output
hello world!
I’m from hdu.
I like acm.

Hint
Remember to use getchar() to read ‘\n’ after the interger T, then you may use gets() to read a line and process it.

分析：其实就是一道逐个单词反转字符串的问题，想到栈的特点是先入后出，并且用栈可以省去很多判断空格的麻烦，那用栈太香了，上代码：