[leetcode]9. Palindrome Number

9. Palindrome Number （c++)

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?

题意：判断回文数字。不使用回文串方法。

思路：新建，赋值，判断….

class Solution
{
public:
  bool isPalindrome(int x)
  {
    int a = 0, b = x;
    while (b>0)
    {
      a = a * 10 + b % 10;
      b = b / 10;
    }
    cout << a << b << endl;
    return a == x ? 1 : 0;
  }
};