Leetcode 7

class Solution {
public:
    int reverse(int x) {
        int flag = 0;
        if(x < 0){flag = 1; x *= -1;}
        long long res = 0;  
        while (x > 0) {              //数字反转 这里写x是不行的
            res = res * 10 + x % 10;
            x = x/10;
        }
        
        if (res > INT_MAX) return 0;//防止溢出

        if(flag == 1){return -res;}
        return res;
    }
};

_