Leetcode(18)

https://leetcode.com/problems/reverse-integer/#/description

Reverse digits of an integer.

Example1: x = 123, return 321
Example2: x = -123, return -321

Solution:

反转数字，这里偷了个懒，用了Long来解决overflow问题。

int ReverseInteger::reverse(int x) {    long base = 0;    while (x) {        base = base * 10 + x % 10;        x /= 10;    }    return (base < INT_MIN || base > INT_MAX) ? 0 : base;}