[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.
思路：回文数，思路简单，负数直接否定，正数把反过来的数求出来和原来数比较即可（仔细想想发现这题好像做过。。。）
Solution:

class Solution {
public:
    bool isPalindrome(int x) 
    {
        bool bRe = false;
        if(x>=0)
        {
            double count = 0;
            int temp =x;
            while(temp!=0)
            {
                int lstBit = temp%10;
                count = count*10+lstBit;
                temp/=10;
            }
            if(count == x)
            {
                bRe = true;
            }
        }
        return bRe;
    }
};

嗯，第一次提交发现居然会出现count溢出，额，题目都没给出输入范围，真是坑。