Leetcode007 Reverse Integer

题目要求：

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

Example 1:

Input: 123Output:  321

Example 2:

Input: -123Output: -321

Example 3:

Input: 120Output: 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 y = x;        double res = 0;                while(y != 0)        {            res = (y%10)+res*10;            y = y/10;        }                if(x > 0)            res = res > Integer.MAX_VALUE?0:res;                if(x < 0)            res = res < Integer.MIN_VALUE?0:res;                        return (int)res;    }}