HDU1062 Text Reverse

1062 Text Reverse

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

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.

这题就是简单的字符串反转，不过由于最近使用Ubuntu，Linux上使用gets函数报dangerous，换用了fgets函数。值得注意的是gets和fgets所得到的串的的不同之处在于fgets将换行符也读入 了。

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;

int main()
{
    freopen("input.txt","r", stdin);
    int n;
    char str[2000];
    scanf("%d",&n);
    getchar();
    while(n--)
    {
        int begin=0;
        int j,k,end;

        fgets(str,2000,stdin);   //所得串含有换行付
        int size=strlen(str);
        str[size-1]='\0';
        size=strlen(str);

        for(int i=0; i<=size; i++)
        {
            if(str[i]=='\0' || str[i]==' ')
            {
                end = i-1;
                int j=begin, k=end;
                while(j<k){
                    char ch=str[j];
                    str[j]=str[k];
                    str[k]=ch;
                    j++, k--;
                }
                begin = end+2;
            }
        }
        puts(str);
    }
}