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.

//Java
class Solution {
    public int reverse(int x) {
        boolean flag = false;
        if (x < 0) {
            flag = true;
            x = -x;
        }
        long sum = 0;
        while (x > 0) {
            sum =sum*10 +x%10;
            x = x/10;
        }
        int res = 0;
        if (flag) {
            sum = -sum;
        }
        //判断是否在指定的范围之内
        if (sum >= Integer.MIN_VALUE && sum <= Integer.MAX_VALUE) {
            res = (int) sum;
        } else {
            //超出指定范围返回0
            res = 0;
        }
        return res;
    }
}