Leetcode#7 Reverse Integer !!!Update (2014-11-10)之后的版本!!!

去年11月份的更新导致CSDN博客里老的题解都是错的。

其实很简单，用long long 考虑下是否溢出，本人愚笨，用最土的方法，不过至少在两CE，两次WA之后AC了，开森~！

题目：

Reverse digits of an integer.

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

click to show spoilers.

Have you thought about this?

Here are some good questions to ask before coding. Bonus points for you if you have already thought through this!

If the integer's last digit is 0, what should the output be? ie, cases such as 10, 100.

Did you notice that the reversed integer might overflow? Assume the input is a 32-bit integer, then the reverse of 1000000003 overflows. How should you handle such cases?

For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

Update (2014-11-10):
Test cases had been added to test the overflow behavior.

    int reverse(int x) {
        int base = 1, len = 1,flag = 0;
        long long ans = 0;
        if (x<0){
            x = -x;
            flag = 1;}
        while((x/base)>=10){
            len++;
            base = base*10;
        }
        for(int i = 0; i<len;i++){
            ans = ans * 10;
            ans = ans + x%10;
            x = x/10;
        }
        if(ans > 2147483647|| ans <0)
            return 0;
        if(flag==1)
            return -ans;
        return ans;
    }