[Leetcode] 9. Palindrome number

#include <stdio.h>#include<stdbool.h>#include<math.h>//9. Palindrome Number//determine whether an integer is a palindrome. Do this without extra space.// https://leetcode.com/problems/palindrome-number///algorithm://get reverse of x = X '//check whether x = = X '//If yes, return True//else, return false//assume x >= 0//assume no ' + ' or '- ' sign at front//Assume no space//base Case:x <, return trueBOOLIspalindrome (intx) {//Base Case    if(X <0)return false;//Negative number is not palindromic    if(X <Ten)return true;//Single digit is palindrome//Get Reverse of x    inty =0, n =x;  while(n) {y= y *Ten+ n%Ten; N/=Ten; }    //if original x equals to their reverse, it is palindrome    if(x = = y)return true; return false;}intMain () {intx =-2147447412; Char*result = ispalindrome (x) >0?"true":"false"; printf ("*%d* is palindrome:%s\n", x, result);}

[Leetcode] 9. Palindrome number