LeetCode-Reverse Integer

Reverse digits of an integer.

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

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.

Note:
The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overflows.

题目要求，保留符号地反转所给的数字X。步骤明确，单独取出X的每个数字，加权10地逐个放入RES翻转数中。其中，有溢出的可能。通过每次更改RES时，比较更改前后两值，即更改后的RES/10是否能够得到更改前的值，判断是否溢出。“保留符号”这一点，测试有：-123%10 = -3， -123/10 = -12。显然，无需理会符号问题。

class Solution {
	public:
		int reverse(int x) {
			int res = 0;
			while(x != 0) {
				int t = res*10 + x%10;
				if(t/10 != res) return 0;
				res = t;
				x = x/10;
			}
			return res;
		}
};