杭电1062（Text Reverse）字符串翻转问题

最新推荐文章于 2021-02-04 13:48:27 发布

huang970507

最新推荐文章于 2021-02-04 13:48:27 发布

阅读量413

点赞数

分类专栏：字符串处理

本文链接：https://blog.csdn.net/huang970507/article/details/51970293

版权

字符串处理专栏收录该内容

4 篇文章 0 订阅

订阅专栏

Text Reverse

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 26291 Accepted Submission(s): 10214

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.
   
   
   
   
    
    一开始做这道题的时候想着用string做，把遇到' '之前的内容存到子字符串中，然后再把刚刚的内容在字符串中删掉，最后把这些子字符串整理下。
   
   
   
   
    
    发现这样来做这道题的话太费时间了，还不如边找边输出快一些。
   
   
   
   
    
    #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
	int n,i,j,asd;
	while(cin>>n)
	{
		getchar();
		while(n--)
		{
			string s;
			getline(cin,s);
			j=0;
			asd=0;
			for(i=0;i<s.length();i++){
				if(s[i]==' '){
					for(j=i-1;j>=asd;j--){
						cout<<s[j];
					}
					cout<<" ";
					asd=i+1;
				}
			}
			for(j=i-1;j>=asd;j--)
				cout<<s[j];
			cout<<endl;

		}
	}
	return 0;
}