HDOJ Text Reverse JAVA 1062

最新推荐文章于 2020-07-15 22:46:48 发布

原创最新推荐文章于 2020-07-15 22:46:48 发布 · 565 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#JAVA #OJ #HDOJ

OJ Test 同时被 3 个专栏收录

105 篇文章

订阅专栏

题库-HDOJ

17 篇文章

订阅专栏

String

7 篇文章

订阅专栏

本文介绍了一个编程挑战，即接收一行由多个单词组成的文本，并将每个单词逆序输出。通过一个Java示例程序展示了如何处理包含空格和特殊字符的字符串，以确保正确反转每个单词。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

这个故事告诉我们看似很简单的一道题也是有坑的。。

捣鼓了好久才找到PE的问题所在

package _1062;

import java.util.Scanner;

public class Main{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		sc.nextLine();
		while((n--)!=0){
//			PE
//			输入qwe  rty  （这里y后面有两个空格）输入应该是ewq  ytr  （也有空格）
			
//			String s = sc.nextLine();
//			String [] ss = s.split(" ");
//			for (int i = 0; i < ss.length; i++) {
//				ss[i] = rev(ss[i]);
//			}
//			for (int i = 0; i < ss.length; i++) {
////				if(ss[i].length()!=0){
//					if(i==ss.length-1)
//						System.out.print(ss[i]);
//					else
//						System.out.print(ss[i]+" ");
////				}
//			}
//			if(n!=0)
//				System.out.println();
			
			String s = sc.nextLine();
			StringBuilder s1 = new StringBuilder();
			StringBuilder s2 = new StringBuilder();
			for (int i = 0; i < s.length(); i++) {
				if(s.charAt(i)!=' '){
					s2.append(s.charAt(i));
					if(i==s.length()-1){
						s2 = rev(s2);
						s1.append(s2);
						s2 = new StringBuilder();
					}
				}else {
					s2 = rev(s2);
					s2.append(' ');
					s1.append(s2);
					s2 = new StringBuilder();
				}
			}
			System.out.println(s1);
			
		}
	}

	private static StringBuilder rev(StringBuilder s2) {
		return s2.reverse();
	}

//	private static String rev(String string) {
//		String s = new StringBuilder(string).reverse().toString();
//		return s;
//	}

}

Text Reverse

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

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.

Author

Ignatius.L