方法一:
import java.math.BigInteger;
public class zsfz {
public static int reverse(int x) {
try {
boolean b = true;
if (x < 0) {
x = -x;
b = false;
}
String a = x + "";
String s = "";
char[] c = a.toCharArray();
for (int i = c.length - 1; i >= 0; i--) {
s =s+c[i];
}
BigInteger a1 = new BigInteger(s);
long result=a1.longValue();
if(b) {
if(result>Integer.MAX_VALUE ) {
return 0;
}else {
return (int)result;
}
}else {
if(-result<Integer.MIN_VALUE) {
return 0;
}else {
return -(int)result;
}
}
}catch(NumberFormatException e) {
return 0;
}
}
}
方法二:
import java.util.Scanner;
public class Test {
public static void main(String[] args) {
Scanner s=new Scanner(System.in);
String a=s.next();
if(a.charAt(0)=='-') {
System.out.print('-');
int c=-1;//可以是不为0的任意数字
for(int i=a.length()-1;i>=1;i--) {
if(a.charAt(i)!='0' ||c==0) {
c=0;//这是关键,为的是不去掉最后一个0前面的那些0
System.out.print(a.charAt(i));
}
}
}
if(a.charAt(0)!='-') {
int c=-1;
for(int i=a.length()-1;i>=0;i--) {
if(a.charAt(i)!='0' ||c==0) {
c=0;
System.out.print(a.charAt(i));
}
}
}
}
}