（Java）leetcode-7 Reverse Integer

题目

【翻转整数】
Given a 32-bit signed integer, reverse digits of an integer.

Example 1:

Input: 123
Output: 321

Example 2:

Input: -123
Output: -321

Example 3:

Input: 120
Output: 21

Note:
Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231, 231 − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

思路

此题要对数字翻转并不难，难点是如何判断整数发生了溢出。
我们在对x模10并加到新值之前，先进行溢出判断，若发生了溢出，在对新值进行逆向操作后已经与原值并不相等，由此判断发生了溢出。

代码

class Solution {
	public int reverse(int x)
	{
	    int result = 0;

	    while (x != 0)
	    {
	        int tail = x % 10;//个位数字
	        int newResult = result * 10 + tail;
	        if ((newResult - tail) / 10 != result) //判断是否溢出
	        { return 0; }
	        result = newResult;
	        x = x / 10;
	    }

	    return result;
	}
}

提交结果

Runtime: 1 ms, faster than 100.00% of Java online submissions for Reverse Integer.
Memory Usage: 32.4 MB, less than 100.00% of Java online submissions for Reverse Integer.