[LeeCode] 7. Reverse Integer

7. Reverse Integer

Easy

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.

 

python3 实现：

python中的数字可以无限大，比如pow(2，100)是可以求出值的，python不会出现数据溢出。

class Solution:
    def reverse(self, x: int) -> int:
        rlt = 0
        temp = x if x >= 0 else -x
        while temp:
            rlt = rlt * 10 + temp % 10
            temp //= 10

        rlt = rlt if x > 0 else -rlt
        if rlt < -1 * pow(2, 31) or rlt > pow(2, 31) - 1:
            return 0
        else:
            return rlt

c++实现：

因为要求是不超过32位，会出现溢出，那么我们直接使用long long类型进行做，最后比较。

int 4个字节

long 4个字节

long long 8个字节

typedef long long ll;
 
class Solution {
public:
    int reverse(int x) {
        
        ll temp = x;
        ll rlt = 0;
        if(temp < 0)
            temp *= -1;
        while(temp) {
            rlt = rlt*10 + temp%10;
            temp /= 10;
        }
        if(rlt<-2147483648 || rlt >=2147483648)
            return 0;
        if(x<0)
            return int(rlt*-1);
        else return int(rlt);
    }
};