int reverse(int x) {
    int maxInts[10] = {2, 1, 4, 7, 4, 8, 3, 6, 4, 7};
    int minInts[10] = {2, 1, 4, 7, 4, 8, 3, 6, 4, 8};
    int* target = x >= 0 ? maxInts : minInts;

    int symbol = x >= 0 ? 1 : -1;
    int result = 0;
    int overflowState = 0;
    int count = 0;
    while (x != 0)
    {
        int n = x % 10 * symbol;
        if (overflowState == 0)
        {
            int maxN = *(target + count);
            if (n > maxN)
            {
                overflowState = 1;
            }
            else if (n < maxN)
            {
                overflowState = -1;
            }
        }

        if (x < 10 && x > -10 && count == 9 && overflowState == 1)
        {
            return 0;
        }

        result = result * 10 + n;
        x = x / 10;
        ++count;
    }

    return result * symbol;
}

int reverse(int x) {
    int result = 0;
    while (x != 0)
    {
        int n = x % 10;
        if (result > INT32_MAX / 10 || (result == INT32_MAX / 10 && n > 7))
        {
            return 0;
        }
        else if (result < INT32_MIN / 10 || (result == INT32_MIN / 10 && n < -8))
        {
            return 0;
        }

        x = x / 10;
        result = result * 10 + n;
    }

    return result;
}