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?

 

判断是否是回文数。以前我只会用字符串逐对比较判断。

负数和非零且个位是0的数字一定不是回文数。循环得到末尾的数和除去末尾的数，前者大于等于后者时停止，并且考虑原数长度奇偶性。

class Solution {
public:
    bool isPalindrome(int x) {
        if(x<0||(x&&x%10==0)){
            return false;
        }
        int sum=0;
        while(x>sum){
            sum=sum*10+x%10;
            x=x/10;
        }
        return x==sum||x==sum/10?true:false;
    }
};