首页 > itarticle > [leetcode] problem 7 – reverse integer

[leetcode] problem 7 – reverse integer

admin 11月 13, 2020 0

Given a 32-bit signed integer, reverse digits of an integer.

Example

No.1

Input: 123

Output: 321

No.2

Input: -123

Output: -321

No.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.

Code

public int (int x) {
    int reverseX = 0;

    while (x != 0) {
        if (Math.abs(reverseX) > Integer.MAX_VALUE / 10)
            return 0;

        reverseX = reverseX * 10 + x % 10;
        x /= 10;
    }

    return reverseX;
}