LeetCode 9. Palindrome Number

最新推荐文章于 2024-09-09 22:01:06 发布

Das-Boot

最新推荐文章于 2024-09-09 22:01:06 发布

阅读量165

点赞数

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

本文链接：https://blog.csdn.net/u010787069/article/details/72862217

版权

Algorithms 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

Description

Determine whether an integer is a palindrome. Do this without extra space.
Hints:
Could negative integers be palindromes? (ie, -1)
If you are thinking of converting the integer to string, note the restriction of using extra space.
You could also try reversing an integer. However, if you have solved the problem “Reverse Integer”, you know that the reversed integer might overflow. How would you handle such case?

Solution

题意要求验证回文数字，并且不能使用额外空间，意味着不能把整数变成字符，然后来验证回文字符串，只能直接对整数进行操作。可以利用取整和取余来获得想要的数字，比如 12321 这个数字，如果计算 12321 / 10000，则可得首位1，如果 12321 % 10，则可得到末尾1，进行比较，然后把中间的232取出继续比较，最后得解。

#include <iostream>

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;
}

int main() {
    int n;
    std::cin >> n;
    std::cout << isPalindrome(n) << std::endl;
    return 0;
}