Text Reverse

最新推荐文章于 2021-08-07 12:56:28 发布

菜鸟的编程之路

最新推荐文章于 2021-08-07 12:56:28 发布

阅读量746

点赞数

分类专栏： javase acmPractice hdu

本文链接：https://blog.csdn.net/u011121525/article/details/9625175

版权

javase 同时被 3 个专栏收录

60 篇文章 0 订阅

订阅专栏

acmPractice

19 篇文章 0 订阅

订阅专栏

hdu

4 篇文章 0 订阅

订阅专栏

Text Reverse

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 4468 Accepted Submission(s): 1269

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.

注意最后竟然有个空格，大坑啊

package hdu;
import java.util.Scanner;
public class Append {
 public static void main(String[] args) {
  Scanner in = new Scanner(System.in);
  int a =Integer.parseInt(in.nextLine());
  for (; a > 0; a--) {
   String s=in.nextLine();
   String[] str = s.split(" ");
   for (int i = 0; i < str.length; i++) {
    System.out.print(reverseString(str[i]));
    if (i < str.length - 1)
     System.out.print(" ");
   }
   if(s.endsWith(" "))
    System.out.print(" ");
   System.out.println();
  }
 }
 private static String reverseString(String string) {
  StringBuffer buf = new StringBuffer();
  buf.append(string);
  return buf.reverse().toString();
 }
}