@Test
public voidreverseTest(){
String str ="123456789";
StringBuilder sbr = new StringBuilder(str);
sbr.reverse();
String strNew = sbr.toString();
System.out.println(String.format("反转前:%s",str.toString()));
System.out.println(String.format("反转后:%s",strNew.toString()));}
字符串转换字符数组,倒序输出数据
@Test
public voidreverseTest2(){
String str ="123456789";char[] c = str.toCharArray();
StringBuilder strNew = new StringBuilder();for(int i = c.length -1; i >=0; i--){
strNew.append(c[i]);}
System.out.println(String.format("反转前:%s",str.toString()));
System.out.println(String.format("反转后:%s",strNew.toString()));}
用栈输出数据(先进后出),栈的特点是先进后出,把字符串中的每个字符按顺序入栈,再依次出栈
@Test
public voidreverseStack(){
String str ="123456789";
Stack stack = new Stack();char[] c = str.toCharArray();for(char c1 : c){
stack.push(c1);}
StringBuilder strNew = new StringBuilder();for(int i =0; i < c.length; i++){
strNew.append(stack.pop());}
System.out.println(String.format("反转前:%s",str.toString()));
System.out.println(String.format("反转后:%s",strNew.toString()));}