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:. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

根据题意，Java限定在Integer中；

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