//新人较笨,大佬勿喷,谢谢。。
Text Reverse
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27674 Accepted Submission(s): 10820
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.
这是一道关于栈的题目。当遇到空格或者结束时反向输出所输入的字符。我用的getchar与循环结合输入单个字符进行判断。结合栈的知识即可完成题目。
#include<stdio.h>
#include<stack> //栈的头文件
using namespace std;
int main()
{ char a;
int t;
scanf("%d",&t);
getchar(); //消除所输入的回车
while(t--)
{stack<char>zhan;
while(true)
{
a=getchar();
if(a==' '||a=='\n'||a==EOF)
{
while(!zhan.empty())
{
printf("%c",zhan.top());
zhan.pop();
}
if(a=='\n'||a==EOF)
break;
printf(" ");
}
else
zhan.push(a);
}
printf("\n");
}
}