LeetCode - Reverse Integer

Reverse digits of an integer.

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

http://oj.leetcode.com/problems/reverse-integer/

Solution:

Start from the last digit which is the input % 10, then add to the previous res times 10

Be careful about the overflow condition, can ask the interviewer for further details

https://github.com/starcroce/leetcode/blob/master/reverse_int.cpp

// 36 ms for 1020 test casesclass Solution {public:    int reverse(int x) {        // IMPORTANT: Please reset any member data you declared, as        // the same Solution instance will be reused for each test case.        int digit = 0, newNum = 0;        while(x != 0) {            digit = x % 10;            newNum = newNum * 10 + digit;            x = x / 10;        }        return newNum;    }};