用三种方法来实现字符串的反转 /** * @(#)ReverseString.java * * ReverseString application * * @author * @version 1.00 2010/4/20 */ import java.util.*; import java.io.*; public class ReverseString { public static void main(String[] args) throws IOException{ // TODO, add your application code String orginal; System.out.println("Please input the string to reverse:/n"); Scanner in=new Scanner(System.in); orginal=in.nextLine(); char[] ch=orginal.toCharArray(); //采用直接反转 /* char[] b=new char[ch.length]; for(int i=0;i<ch.length;i++){ b[i]=ch[ch.length-1-i]; } for(int i=0;i<ch.length;i++){ System.out.print(b[i]); } */ /* char temp; for(int i=0;i<ch.length/2;i++){ temp=ch[i]; ch[i]=ch[ch.length-1-i]; ch[ch.length-1-i]=temp; } for(int i=0;i<ch.length;i++){ System.out.print(ch[i]); } */ //用栈来实现 Stack st=new Stack(); for(int i=0;i<ch.length;i++){ st.push(ch[i]); } for(int i=0;i<ch.length;i++){ System.out.print(st.pop()); } } } 这才觉得没有指针,程序的灵活性大减...