题目:
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
Here are some good questions to ask before coding. Bonus points for you if you have already thought through this!
If the integer's last digit is 0, what should the output be? ie, cases such as 10, 100.
Did you notice that the reversed integer might overflow? Assume the input is a 32-bit integer, then the reverse of 1000000003 overflows. How should you handle such cases?
For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.
此题有一个陷阱就是溢出问题,需要判断是否溢出,其他简单
代码如下:
public class Solution {
public int reverse ( int x ) {
long sum = 0;
while( x ! = 0 ) {
int temp = x % 10;
sum = sum * 10 + temp;
if( sum > Integer.MAX_VALUE || sum < Integer.MIN_VALUE ) {
sum = sum > 0 ? Integer.MAX_VALUE : Integer.MIN_VALUE;
return 0;
}
x = x / 10;
}
return ( int ) sum;
}
}