LeetCode | 7. Reverse Integer

Description

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.

Overflow要当心！

为什么要用long才能不陷入overflow的陷阱呢？

class Solution {
public:
    int reverse(int x) {
        int pop = 0;
        int push = 0;
        long result = 0;
        
        while (x != 0) {
            pop = x%10;
            x = x/10;
            result = result*10+pop;
        }

        return (result > INT_MAX || result < INT_MIN)? 0:result;
    }
};