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; } };
再水
LeetCode Reverse Integer,布布扣,bubuko.com
原文：http://www.cnblogs.com/lailailai/p/3806044.html