[leecode] Palindrome Number

最新推荐文章于 2024-09-16 06:54:08 发布

Brett-Xu

最新推荐文章于 2024-09-16 06:54:08 发布

阅读量88

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/weixin_41814716/article/details/83214705

版权

LeetCode 专栏收录该内容

102 篇文章 0 订阅

订阅专栏

Question:

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