Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
click to show spoilers.
这题挺简单的,我用了一个比较取巧的方式。效率不会太高。可以用普通的方式来做,那样效率会高很多。
public class Solution {
public int reverse(int x) {
int i = 0;
boolean b = x>0?true:false;
int temp = b?x:-x;
String str = null;
if(temp >0){
str = ""+temp;
}else{
str = "2147483648";
}
char[] a = str.toCharArray();
String end = "";
for(int j = a.length-1;j>=0;j--){
end += a[j];
}
end = end.compareTo("2147483647")>0&&b?end.substring(0, end.length()):end;
if(end.length()>=10&&end.compareTo("2147483647")>0&&b){
end = "0";
}else if(end.length()>=10&&end.compareTo("2147483648")>0&&!b){
end = "0";
}
if(end.equals("2147483648")){
i = -2147483648;
}else {
i = b?Integer.valueOf(end):-Integer.valueOf(end);
}
return i;
}
}
Example1: x = 123, return 321
Example2: x = -123, return -321
click to show spoilers.
这题挺简单的,我用了一个比较取巧的方式。效率不会太高。可以用普通的方式来做,那样效率会高很多。
public class Solution {
public int reverse(int x) {
int i = 0;
boolean b = x>0?true:false;
int temp = b?x:-x;
String str = null;
if(temp >0){
str = ""+temp;
}else{
str = "2147483648";
}
char[] a = str.toCharArray();
String end = "";
for(int j = a.length-1;j>=0;j--){
end += a[j];
}
end = end.compareTo("2147483647")>0&&b?end.substring(0, end.length()):end;
if(end.length()>=10&&end.compareTo("2147483647")>0&&b){
end = "0";
}else if(end.length()>=10&&end.compareTo("2147483648")>0&&!b){
end = "0";
}
if(end.equals("2147483648")){
i = -2147483648;
}else {
i = b?Integer.valueOf(end):-Integer.valueOf(end);
}
return i;
}
}