G - Text Reverse

最新推荐文章于 2025-12-02 19:20:40 发布

原创最新推荐文章于 2025-12-02 19:20:40 发布 · 122 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #栈 #stack

STL 专栏收录该内容

25 篇文章

订阅专栏

该程序代码用于读取 Ignatius 写的反向文字，并将其还原为正常顺序。程序通过栈来处理单词的反转，对于每个测试用例，它会接收一行文字并输出处理后的结果。

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.

#include<stdio.h>
#include<string.h>
#include<stack>
#include<iostream>
using namespace std;
int main()
{
	int n;
	cin>>n;getchar();
	while(n--)
	{
		
		char a[1010];
		gets(a);
		stack<char>s;
		
		for(int i=0;i<strlen(a);i++)
		{
			if(a[i]==' ')
			{
				while(!s.empty())
				{
					cout<<s.top();
					s.pop();
				}
				cout<<" ";
			}
			else if(a[i+1]=='\0')
			{
				s.push(a[i]);
				while(!s.empty())
				{
					cout<<s.top();
					s.pop();
				}
			}
			else
			{
				s.push(a[i]);
			}
			
		//	printf("%d",i);
		}
		printf("\n");
	} 
	return 0;
}