LetCode 7. 反转整数

class Solution {
public:
    int reverse(int x) {        
        long long num = x;
        int flag = 1;
        if (num < 0) { flag = -1; num = -num; }
        long long result = 0;
        while (num != 0) {
            int mod = num % 10;
            num = num / 10;
            result = 10*result + mod;
        }
        result = result * flag;
        if (result > INT_MAX || result < INT_MIN) return 0;
        return result;
    }
};