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?

思路：

1.首先将整数x通过std::to_string(x)转换为字符串，然后再通过双指针法同时从首位向中间查询遍历即可。

C++代码：

class Solution {
public:
    bool isPalindrome(int x) {
        string s=std::to_string(x);
        int left=0;
        int right=s.size()-1;
        while(left<right)
        {
            if(s[left]!=s[right])
            {
                return false;
            }
            left++;
            right--;
        }
        return true;
    }
};

 2.follow up不用将数字转换为字符串，直接对整数进行操作，我们可以利用取整和取余来获得我们想要的数字，比如1221这个数字，如果计算1221/1000，则可得首位1，如果1221%10，则可得到末尾1，进行比较，然后把中间的22取出继续比较。其中取出中间的22还是需要技巧的x = (x % div) / 10;且div/=100。

C++代码：

class Solution {
public:
    bool isPalindrome(int x) {
        if (x < 0) return false;
        int div = 1;
        while (x / div >= 10) div *= 10;
        while (x > 0) {
            int left = x / div;
            int right = x % 10;
            if (left != right) return false;
            x = (x % div) / 10;
            div /= 100;
        }
        return true;
    }
};