9. Palindrome Number（回文数）

9. Palindrome Number

Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.

Example 1:

Input: 121
Output: true

Example 2:

Input: -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: 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.

Follow up:

Coud you solve it without converting the integer to a string?

(不能用String转换）

 

整体题目还是比较简单的，一个回文数首先不能小于0，其次%10时不能为0(不能被10整除)，如果为0的话返回true；

首先进行while循环，每次取余，把余数相加，最后对求和数和x的比较。

class Solution {
    public boolean isPalindrome(int x) {
        
       if(x < 0){
            return false;
        }
        if(x>0 && x%10 == 0){
            return false;
        }
        if(x == 0){
            return true;
        }

        int xcopy = x;
        int a = 0;
        int b = 0;

        while(xcopy > 0){
            a = xcopy % 10; //用来接受最后一位数
            b = b*10 + a;   //将最后一位数放到第一位
            xcopy = xcopy / 10;
        }

        if(b != x){
            return false;
        }

        return true;
    }
}