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
 

Follow up: Could you solve it without converting the integer to a string? 

时间复杂度：O(logn)，对于每次迭代，我们会将输入除以10，因此时间复杂度为 O(logn)。
空间复杂度：O(1)。我们只需要常数空间存放若干变量。

反转一半数字

bool isPalindrome(int x){
    if(x < 0 || x != 0 && x % 10 == 0) return false;
    int revertnmuber = 0;
    while(x > revertnmuber){
        revertnmuber = revertnmuber * 10 + x % 10;
        x/=10;
    }
    return x == revertnmuber || x == revertnmuber/10;
}

• 负数一定不是回文数，尾数为0时此数若不是0则一定不是回文数
• 反转一半后与原值比较是否相等，奇数位则去掉尾数作比较，偶数位直接比较