/*

* @lc app=leetcode id=7 lang=java

*

* [7] Reverse Integer

*/

// @lc code=start

class Solution {

public int reverse(int x) {

//Integer.MAX_VALUE = 2147483647

//Integer.MIN_VALUE = -2147483648

int result = 0;

while (x != 0) {

int pop = x % 10;

x = x / 10;

if (result > Integer.MAX_VALUE / 10 || (result == Integer.MAX_VALUE / 10 && pop > 7)) {

return 0;

}

if (result < Integer.MIN_VALUE / 10 || (result == Integer.MIN_VALUE / 10 && pop < -8)) {

return 0;

}

result = result * 10 + pop;

}

return result;

}

}

// @lc code=end