标签：case integer bit show read points note input while
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.
Note:
The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overflows.
1 public class Solution { 2 public int reverse(int x) { 3 int result = 0; 4 5 while (x != 0) { 6 int current = x % 10; 7 8 if (result > Integer.MAX_VALUE / 10 || (result == Integer.MAX_VALUE / 10 && current > Integer.MAX_VALUE) || 9 result < Integer.MIN_VALUE / 10 || (result == Integer.MIN_VALUE / 10 && current < Integer.MIN_VALUE)) return 0; 10 result = result * 10 + current; 11 x /= 10; 12 } 13 return result; 14 } 15 }
1 public class Solution { 2 public int reverse(int x) { 3 int result = 0; 4 5 while (x != 0) { 6 int current = x % 10; 7 8 int newResult = result * 10 + current; 9 if ((newResult - current) / 10 != result) return 0; 10 result = newResult; 11 x /= 10; 12 } 13 return result; 14 } 15 }
标签：case integer bit show read points note input while
原文地址：http://www.cnblogs.com/amazingzoe/p/6391758.html
