[leetcode]7. Reverse Integer@Java解题报告

https://leetcode.com/problems/reverse-integer/description/

Reverse digits of an integer.

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

click to show spoilers.

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

本体比较简单，最重要的是考虑溢出问题

package go.jacob.day729;

/**
 * 7. Reverse Integer
 * @author Jacob
 *
 */
public class Demo4 {
	public int reverse(int x) {
		int res=0;
		while(x!=0){
			//最后一位
			int tail=x%10;
			int newRes=res*10+tail;
			//如果newRes-tail)/10!=res说明产生了溢出
			if((newRes-tail)/10!=res)
				return 0;
			res=newRes;
			x=x/10;
		}
		return res;
	}
}