class Solution { public: int reverseInteger(int n) { long long res = 0; while (n != 0) { res = 10 * res + n % 10; n /= 10; } return (res < INT_MIN || res > INT_MAX) ? 0 : res; } };