[LeetCode OJ 007] Reverse Integer

[LeetCode OJ 007] Reverse Integer

 

Question:

Reverse digits of an integer.

Example1: x = 123, return 321
Example2: x =-123, return-321

Have you thought about this?

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 shoshould 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 can you handle such cases?

For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

Sample Code:

 

public class Solution {     public int reverse(int x)  { if(x==0) return 0; int value=Math.abs(x); long result=0; int m=value; while(m>0) { result=result*10+m%10; m=m/10; } if (result > 2147483647)  return 0; if(x>0) return (int)result; else return (int)-result; }}