Leetcode 7. Reverse Integer

https://leetcode.com/problems/reverse-integer/

class Solution {
public:
    int reverse(int x) {
        /*
        1.-x可能溢出
        2.x反转后也可能溢出
        */
        #include<algorithm>
        if(x==0x80000000 ) return 0;
        if(x<0) return -reverse(-x);
        string s=to_string(x);
        std::reverse(s.begin(),s.end());
        long long int val=stoll(s);
        return val>0x7fffffff?0:val;
    }
};

python版本

class Solution:
    def reverse(self, x: int) -> int:
        if x>=0:
            x= int(str(x)[::-1])
        else:
            x= -int(str(-x)[::-1])
        return x if x>=-pow(2,31) and x<=pow(2,31)-1 else 0