LeetCode 7. 整数反转

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