Leetcode||7. Reverse Integer

7. Reverse Integer

• Total Accepted: 178306
• Total Submissions: 751845
• Difficulty: Easy
• Contributors: Admin

Reverse digits of an integer.

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

溢出问题没考虑清楚会导致runtime error

代码如下：

public class Solution {
    public int reverse(int x) {
        int rev = 0;
		while (x!=0) {
			if (rev!=0&&Integer.MAX_VALUE/rev<10&&Integer.MAX_VALUE/rev>-10) {
				return 0;
			}
			rev = rev*10 + x%10;
			x=x/10;
		}
        return rev;
    }
}