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

class Solution {
public:
    int reverse(int x) {
        if(abs(x) < 10) return x;
        long ret = 0;
        while(x){
            ret = ret * 10 + x % 10;
            x /= 10;
        }
        return ret > INT_MAX || ret < INT_MIN ?0:(int)ret;

    }
};