beats 76%
public class Solution {
public int reverse(int x) {
long result=0l;
long num=x>0?(long)x:-(long)x;
while(num!=0){
result=(result*10+num%10);
num/=10;
}
if(x<0){
long res=-1*result;
if(res<Integer.MIN_VALUE)
return 0;
else
return (int)res;
}
else{
if(result>Integer.MAX_VALUE)
return 0;
else
return (int)result;
}
}
}