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 hold integers within the 32-bit signed integer range. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

代码如下

class Solution {
public:
    int reverse(int x) {
	int sum = 0;
	while (x != 0)
	{
		if (abs(sum) > 214748364) return 0;
		sum = sum * 10 + x % 10;
		x = x / 10;
	}
	return sum;
    }
};

很简单的一个题 只要考虑返回值溢出时返回 0 就行了