LeetCode Reverse Integer

题目来源： https://leetcode.com/problems/reverse-integer/

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.
 
 

题目测试数据中，有一个是-2147483648，在vs2013下直接报错：int无法用-2147483648进行赋值。所以找了下网上的答案：

才知道，碰到这种情况该怎么办。

class Solution {
public:
	int reverse(int x) {
	    if(x==INT_MIN)//这里必须要判断   应为 INT_MIN  为了表示方便用八位 二进制为 1000 0000  进行x=-x运算时，计算机中用补码相乘，-1的补码为原码除符号位外取反加1  也就是 1000 0001  取反加一补码变为 1111 1111，所以x=-x变为补码乘法 1000 0000*1111 1111 =1000 0000，x又等于了INT_MIN ,所以当while循环中的x并没有为正数。
	    return 0;
		int y = x;
		if (x<0)
			y = y*-1;
		long long z = 0;
		while (y)
		{
			z = z * 10 + y % 10;
			y = y / 10;
		}
		if (x>0 && z >= 2147483647)
			return 0;
		if (x < 0 && z >= 2147483648)
			return 0;
		if (x < 0)
			z = z*-1;
		return z;
	}
};