HDOJ/HDU 1062 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.

题意：
输入一行字符串，将每一个单词(只有空格隔开)倒序输出！

注意：
开始和结尾可能有多个空格，单词之间可能有多个空格！

PE的请注意：空格必须照原样输出！有几个输出几个，不能多输出也不能少输出！

import java.util.Scanner;

/**
 * @author 陈浩翔
 * 2016-5-25
 */
public class Main{ public static void main(String[] args) { Scanner sc = new Scanner(System.in); int t =sc.nextInt(); sc.nextLine();//读取输入t之后的回车 while(t-->0){ String str=sc.nextLine(); String s[] = str.split(" "); String str2=""; for(int i=0;i<s.length;i++){ for(int k=s[i].length()-1;k>=0;k--){ System.out.print(s[i].charAt(k)); str2+=s[i].charAt(k); } if(i!=s.length-1){ System.out.print(" "); str2+=" "; } } for(int i=str2.length();i<str.length();i++){ System.out.print(" "); } System.out.println(); } }
}

  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
  
19
  
20
  
21
  
22
  
23
  
24
  
25
  
26
  
27
  
28
  
29
  
30
  
31
  
32
  
33
  
34
  
35
 

文章来源: chenhx.blog.csdn.net，作者：谙忆，版权归原作者所有，如需转载，请联系作者。

原文链接：chenhx.blog.csdn.net/article/details/51499790