leetcode Reverse Integer

int reverse(long long x)
{
    long long m = x;
    if (x<INT_MIN||x > INT_MAX)
    {
        return 0;
    }
    if (m < 0)
    {
        return 0 - reverse(0 - m);
    }
    long long y = 0;
    while (m > 0)
    {
        int c = m % 10;
        m = m / 10;
        y = y * 10 + c;
    }
    if (y<INT_MIN || y>INT_MAX)
    {
        return 0;
    }
    return y;
}