[LeetCode 7] Reverse Integer 不能一次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.

1、这道题不难，就是考察细节处理。而这些是我最欠缺的，其实啥都欠缺，咋整。。。。

2、细节现在总结的有：边界值处理，特殊值处理，循环条件，逻辑判断（写出的是否跟想的一样）。这下全都是细节了。。。。

3、int的最大存储正数是2的31次方，因为还有一位存符号

class Solution {
public:
    int reverse(int x) {
        bool c=false;
        long long r=0;
        while(x)
        {
            if(x%10)
            {
                c=true;
                r=r*10+x%10;
                if(r>=2147483647)
                    return 0;
                else if(r<-2147483648)
                    return 0;
            }
            else
            {
                if(c)
                {
                    r=r*10+x%10;
                    if(r>=2147483647)
                        return 0;
                    else if(r<-2147483648)
                        return 0;
                }
            }
            x=x/10;
        }
        return (int)r;
    }
};