Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
一看这一题目好简单的说,13行代码,关键要做边界检查。
public class Solution {
public int reverse(int x) {
int sign = x>0?1:-1;
long result = 0;
x = Math.abs(x);
for(;x!=0;x=x/10){
result = result*10+x%10;
if(result > Integer.MAX_VALUE || result < Integer.MIN_VALUE)//边界检查
return 0;
}
return (int) (result*sign);
}
}