LeetCode 9 palindrome (回文数)

最新推荐文章于 2021-01-22 16:05:02 发布

花开彼岸天x

最新推荐文章于 2021-01-22 16:05:02 发布

阅读量306

点赞数

分类专栏：算法文章标签：回文数 LeetCode 9 palindrom palindrome

本文链接：https://blog.csdn.net/banana1006034246/article/details/65437712

版权

算法专栏收录该内容

27 篇文章 0 订阅

订阅专栏

[ LeetCode 9palindrome ]

Description

Determine whether an integer is a palindrome. Do this without extra space.

Samples: 1234321 1221都是回文数，负数不属于回文数。中心对称的数是回文数

#include<stdio.h>
#include<stdbool.h>
#include<string.h>

#define N 11
/*
* #define MAX_INT ((unsigned)(-1) >> 1)
*#define MIN_INT (MAX_INT + 1)
*/
bool isPalindrome(int x) {
        int MAX_INT = (unsigned)(-1) >> 1;
        //int MIN_INT = MAX_INT + 1;
        char string[N];
        int length;
        int i=0;
        if(x > MAX_INT || x < 0)
                return 0;
        sprintf(string, "%d", x);
        length = strlen(string);
        if(length == 1)
                return 1;
        while(i < length/2)
        {
                if(string[i] == string[length - i - 1]) i++;
                else break;
        }
        if(i == length/2)
                return 1;
        return 0;
}
int main(void)
{

        int x;
        scanf("%d",&x);
        bool bl=isPalindrome(x);
        if(bl) printf("%d is Palindrome\n",x);
        else    printf("%d is not Palindrome\n",x);

        return 0;
}