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) {
        int result = 0, isPos = 1;
        long long tmp = 0;
        if( x == -2147483648 )
			return 0;
        if( x < 0 )
        {
            isPos = -1;
            x *= -1;
        }
        while( x )
        {
            tmp *= 10;
            tmp += ( x % 10 );
            x /= 10;
            
            if( tmp >= 2147483647 )
            {
                tmp = 0;
                break;
            }
        }
        result = tmp * isPos;
        return result;
    }
};