LeetCode Reverse Integer

class Solution {
public:
    int reverse(int x) {
        bool neg = x < 0;
        long long num = x;
        if (neg) num = -num;
        long long out = 0;
        while (num) {
            out = out * 10 + num % 10;
            num /= 10;
        }
        if (neg) return -out;
        return out;
    }
};