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 long r=0;
        long long t=x;
        if(x==-2147483648)
            return 0;
        t=x>0?x:-x;
        for(;t;t/=10)
            r=r*10+t%10;
        bool sign=x>0?false:true;
        if(r>2147483647||(sign&&r>2147483648))
            return 0;
        else
        if(sign)
            return -r;
        else
            return r;
    }
};

解法二：

class Solution {

public:

int reverse(int x) {

int ans = 0;

while (x) {

int temp = ans * 10 + x % 10;

if (temp / 10 != ans)

return 0;

ans = temp;

x /= 10;

}

return ans;

}

};