hdu oj 1062 Text Reverse（字符串）

Text Reverse

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

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()，因为t 后用gets()读入字符串，。。。。。用scanf()就不用加getchar().
 
     
 
 
     
字符串问题，主要是找到空格" ".
 
     
 
 
     
 
     
#include<stdio.h>
#include<string.h>
int main()
{
    int t;
    char str[1000+10];
    scanf("%d",&t);
    getchar();//必须有，不然输入数据就会少一组 
    while(t--)
    {
        gets(str);
        int l=strlen(str);
        int m=0,k=0;
        for(int i=0;i<l;i++)
        {
            if(str[i]==' ')
            {
                m=i; 
                for(int j=m-1;j>=k;j--)
                {
                    printf("%c",str[j]);
                }
                printf("%c",str[i]);
                k=m+1;//新单词出现，j的结束值 
            }
        }
        for(int j=l-1;j>=k;j--)//输出最后一个单词 
        {
            printf("%c",str[j]);
        }
        printf("\n");
    }
    return 0;
}