LeetCode#9. Palindrome Number

9. Palindrome Number

Given an integer x, return true if x is palindrome integer.

An integer is a palindrome when it reads the same backward as forward. For example, 121 is palindrome while 123 is not.

Example 1:

Input: x = 121
Output: true

Example 2:

Input: x = -121
Output: false
Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.

Example 3:

Input: x = 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.

Example 4:

Input: x = -101
Output: false

Constraints:

• -231<= x <= 231- 1

---

这题和第7题差不多意思

class Solution {
    public boolean isPalindrome(int x) {
        if (x<0){
            return false;
        }else{
            int n = x;
            int r = 0;
            while (n != 0) {
                if (r < Integer.MIN_VALUE / 10 || r > Integer.MAX_VALUE / 10) {
                    return false;
                }
                r = r * 10 + n % 10;
                n /= 10;
            }
            return r==x;
        }
    }
}