LeetCode-009：Palindrome Number

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/qq_32360995/article/details/86376744

题目：

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?

题意：

看一个整数是否是回文数字。

思路：

水题。负数肯定不是回文数字，再把正整数不断%10求数位翻转后的整数，判断两个数是否相等~好像忘记了翻转后的数字有没有溢出的问题，既然过了也就懒得理了emmm~觉得187ms好多，没想到这样还能击败87%多的人，他们直接int转字符串吗？hhh...

Code：

class Solution {
public:
    bool isPalindrome(int x) {
        if(x<0) return false;
        int y=0,t=x;
        while(t){
            int k=t%10;
            t/=10;
            y=y*10+k;
        }
        if(x==y) return true;
        return false;
    }
};