loser的OJ笔记
失败篇,失败,极其失败,没有考虑到溢出是一回事,另一回事是代码有点繁杂。
class Solution {
public int reverse(int x) {
int count = 0;
int xcopy=x;
while(xcopy!=0){
xcopy=xcopy/10;
count++;
}
int rev[]=new int[count];
int xcopytwo=x;
for(int i = 0;i<count;i++){
rev[i]=xcopytwo%10;
xcopytwo=xcopytwo/10;
}
int result = 0;
for(int j=0;j<count;j++){
if(rev[j]>=2&&count>=11){
return 0;
} else {rev[j]=(int)(rev[j]*Math.pow(10,(count-j-1)));
result=result + rev[j];
}
}
if(result < Math.pow(-2, 31) || result > (Math.pow(2, 31) - 1)) {
return 0;
}else if(x>0){
return Math.abs(result);
}else {
return -Math.abs(result);
}
}
}
下面是成功解法
class Solution {
public int reverse(int x) {
int rev = 0;
while (x != 0) {
int pop = x % 10;
x /= 10;
if (rev > Integer.MAX_VALUE/10 || (rev == Integer.MAX_VALUE / 10 && pop > 7)) return 0;
if (rev < Integer.MIN_VALUE/10 || (rev == Integer.MIN_VALUE / 10 && pop < -8)) return 0;
rev = rev * 10 + pop;
}
return rev;
}
}