Text Reverse
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.
废话:
从这道题弄明白gets和get和scanf,gets和get是可以读取空格的,遇到回车才会结束.gets是接收一行字符串,get是接收一个字符,scanf是不会读取空格的,遇到空格和回车就会结束.这里需要接收一行字符串所以需要用gets.首先一行行的用gets收入字符串放入a数组,然后用strlen(a)算出字符串的长度(字母+符号+空格)赋值给Long.用for循环遍历数组a,遇到空格就反向输出,用i–,来一次反向输出就要加一个空格.我们for循环用的结束条件是判断a[i]等不等于\0(每个数组后面结束都会有一个\0,但是不计入长度),所以字符串最后一个词组不会在此for循环输出来,所以提到外面再输出.
代码:</