Hdu 1062
来源:互联网 发布:php mysql 事务处理 编辑:程序博客网 时间:2024/06/05 15:44
Text Reverse
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 29094 Accepted Submission(s): 11433
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.
题解:字符串反串,可以运用栈原理。
import java.util.Scanner;public class Main { public static String revert(String s){ String res = ""; char[] s1 = s.toCharArray(); for(int i=s1.length-1;i>=0;i--){ res+=s1[i]; }// System.out.println(res); return res; } public static void main(String[] args) { Scanner in = new Scanner(System.in); int N = in.nextInt(); in.nextLine(); while(N-- > 0){ String str = in.nextLine();// System.out.println(str.length()); //字符串处理 String[]strs = str.split(" "); String res = "";// System.out.println("length"+strs.length); for(int i=0;i<strs.length;i++){ if(i==strs.length-1) res += revert(strs[i]); else res += revert(strs[i]) + " "; } if(str.endsWith(" ")) res += " ";//Java代码需要考虑这种情况,不然提交PE。 //PE后反思了一下发现还是自己写的方法靠谱一些,处理出的东西不是杂七杂八的 System.out.println(res); } }}
这是我自己没用Java库提供的方法处理字符串,居然简洁的不得了,只有20多行代码,啊哈哈,而且一次AC
import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); int N = in.nextInt(); in.nextLine(); while(N-- > 0){ String str = in.nextLine(); //字符串处理 String res = ""; String res1 = ""; for(int i=0;i<str.length();i++){ if(str.charAt(i) == ' '){ res += res1; res += str.charAt(i); res1 = ""; }else{ res1 = str.charAt(i) + res1; } } res += res1; System.out.println(res); } }}
- HDU 1062
- HDU 1062
- HDU 1062
- HDU-1062
- hdu 1062
- HDU 1062
- HDU 1062
- HDU-1062
- Hdu 1062
- hdu 1062
- hdu 1062 Text Reverse
- hdu 1062 Text Reverse
- HDU 1062 TEXT REVERSE
- Hdu 1062 - Text Reverse
- hdu 1062 Text Reverse
- HDU 1062 Text Reverse
- hdu 1062 Text Reverse
- hdu 1062 字符串处理
- 简单实现ssh免密登录
- python将日志导入数据库代码案例2
- C++多态
- windbg常用命令
- 排序算法的下界和如何超越下界(摘自算法基础)
- Hdu 1062
- 【PAT】1039. Course List for Student
- 多启动U盘制作流程
- C++字符串和string类
- [nginx] 在虚拟机中的 web 无法被主机访问的解决方法
- react入门教程
- Linux 批量安装 软件包的简单方法
- iOS Xcode8下CoreData的简单应用
- Redis基础教程一