LeetCode(7) Given a 32-bit signed integer, reverse digits of an integer解题报告

将一个32位的数字反转

问题:

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 hold integers within the 32-bit signed integer range. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

大意:

给定一个有符号的整数，将每一位反转然后输出。注意:如果数字溢出，返回0

解题方案:

    public int reverse(int x) {        int result = 0;        while (x != 0) {            int mod = x % 10;            x = x / 10;            if (result > Integer.MAX_VALUE / 10 || result < Integer.MIN_VALUE / 10) return 0;            result = result * 10 + mod;        }        return result;    }