LeetCode 数学

7. Reverse Integer

Given a 32-bit signed integer, reverse digits of an integer.

Example 1:

Input: 123
Output: 321
Example 2:

Input: -123
Output: -321
Example 3:

Input: 120
Output: 21
Note:
Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231,  231 − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.
 

特别注意事项：范围问题

class Solution {
public:
    int reverse(int x) 
    {
        long long nResult = 0;
        while (x != 0)
        {
            int t = nResult * 10 + x % 10;//
            if (t / 10 != nResult) 
                return 0;
            nResult = t;
            x /= 10;
        }
        return nResult;
         //return (nResult > INT_MAX || nResult < INT_MIN) ? 0 : nResult;
    }
};
//补充点知识：头文件limits.h ，NT_MAX和INT_MIN分别表示最大、最小整数，
//int占4字节32位，根据二进制编码的规则，INT_MAX = 2^31-1，INT_MIN= -2^31.C/C++中，所有超过该限值的数，都会出现溢出，出现warning，但是并不会出现error。如果想表示的整数超过了该限值，可以使用长整型long long 占8字节64位。