LeetCode - Refresh - Reverse Integer

Remember to check overflows.

class Solution {
public:
    int reverse(int x) {
        int sign = x < 0 ? -1 : 1, result = 0;
        x = fabs(x);
        while (x > 0) {
            if (result > (INT_MAX - x%10)/10) {
                return 0;
            }
            result = result*10 + x%10;
            x /= 10;
        }
        return sign * result;
    }
};