//反转字符串classSolution{publicvoidreverseString(char[] s){if(s == null || s.length ==1){return;}int length = s.length;char tmp;for(int i =0;i<length/2;i++){
tmp = s[i];
s[i]= s[length-1-i];
s[length-1-i]= tmp;}}}---------------------------------------------------------------//反转整数classSolution{publicintreverse(int x){//这个result的类型必须为long,否则报错。 long result =0;//逐步剥离数字的方法,很巧妙while(x !=0){
result = result *10+ x %10;
x /=10;}//如果超过了阈值,则返回0if(result > Integer.MAX_VALUE || result < Integer.MIN_VALUE){
result =0;}//注意这里,必须要再将long转化为int类型,因为方法的返回类型为int,必须转化,否则报错。return(int)result;}}