LeetCode #9. Palindrome Number

最新推荐文章于 2022-11-11 10:21:59 发布

西瓜君的父亲

最新推荐文章于 2022-11-11 10:21:59 发布

阅读量250

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/a1008610001123/article/details/90242610

版权

LeetCode 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

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) {
        if(x<0)
            return false;
        int x2=x;
        long y=0;
        int temp;
        while(x2){
            y*=10;
            y+=(x2%10);
            x2/=10;
        }
        if(x==y)
            return true;
        else
            return false;
    }
};

总结：easy