HDU1062 Text Reverse

Problem 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.

Author
Ignatius.L

Recommend
We have carefully selected several similar problems for you: 1020 1073 1039 1088 1004

康复训练第三题
题意：输入一个字符串，把里面的单词都倒着输出
思路：练习了用栈来解决。先把字符都丢入栈，遇到空格或者回车，就把栈里面的东西给pop出来。利用了栈先入后出的特性

#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<stack>using namespace std;stack<char> s;void zhengling(){    while(!s.empty())    {        cout<<s.top();        s.pop();    }}int main(){    int num;    cin >> num;    getchar();//吸收回车符     while(num--)    {        char c;        while(true)        {            c = getchar();            if(c==' ')            {                zhengling();                cout<<" ";            }            else if(c=='\n')            {                zhengling();                cout<<endl;                break;              }            else s.push(c);        }    }    return 0;}