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: [−2^31, 2^31 − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

解题思路

将一个数反转

主要是注意一下反转的数需要有范围，在 [−2^31, 2^31 − 1]范围内才可以，所以这里面利用一个if语句进行判断

AC代码

class Solution {
    public int reverse(int x) {
        int result = 0;
        while(x != 0) {
            int tail = x % 10;
            int newResult = tail + result * 10;
            //如果新的数减去后添加的数除以10不等于上一个数result，则说明已经越界了。
            if((newResult - tail) / 10 != result)
                return 0;
            result = newResult;
            x = x / 10;
        }
        return result;
    }
}