LeetCode : reverse integer

解法：

class Solution {
public:
    int reverse(int x) {
        int signal = (x>0)? 1:-1;   /* signal记录正负号 */
        x=abs(x);
        int tmp = 0;

        if(x == 0)
            return x;

        while(x)
        {
            tmp = tmp*10+x%10;
            x = x/10;
        }

        tmp = tmp*signal;      /* 乘上符号 */

        return tmp;
    }
};