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.

程序：

class Solution {
public:
    int reverse(int x) {
        long p = 0;
        while(x != 0)
        {
            p  = p * 10 + x % 10;
            x /= 10;
        }
        if(p > INT_MAX || p < INT_MIN) 
            return 0;
        else 
            return p;
    }
};