LeetCode-Reverse Integer

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.

C++版本：
#include<bits/stdc++.h>
using namespace std;
long long reverse(long long x){
	int max_int=pow(2,31)-1;
    int min_int=-pow(2,31);
    if(x>max_int||x<min_int)
    return 0;
	long long sum=0;
	long long temp=abs(x);
	while(temp){
		sum=sum*10+temp%10;
		temp/=10; 
	}
	if(sum>max_int||sum<min_int)//原来的数据可能不越界，ans可能越界 
    return 0;
	if(x>0)
	return sum;
	else return -sum;
}
int main(){
	cout<<reverse(1534236469)<<endl;
	return 0;
}

python3
def reverse(x):
    intMax=2**31-1
    intMin=-2**31
    rev=0
    sign=1
    if x>intMax or x<intMin:
        return 0
    if x<0:
        sign=-1
        x*=sign
    while x!=0:
        pop=x%10
        x=int(x/10)
        rev=rev*10+pop # 反过来可能越界input:1534236469 output:9646324351
    return 0 if rev>intMax or rev<intMin else rev*sign
print(reverse(1534236469))