判断整数是否是回文
bool isPalindrome(int x) {
if(x < 0)
{
return false;
}
int t = x / 10;
int length= 1;
while(t)
{
length = length * 10;
t = t / 10;
}
int left;
int right;
int r = x;
while(x)
{
left = r / length;
right = x % 10;
if(left != right)
{
return false;
}
r = r % length;
length = length / 10;
x = x/10;
}
return true;
}
Palindrome Number Validate Palindrome Palindrome Partitio...
D133 9. Palindrome Number 题目链接 9. Palindrome Number[https...
Palindrome Number 答案:
title: Palindrome Numbertags:- palindrome-number- No.9- s...
Palindrome Number Longest Common Prefix Valid Parentheses
Palindrome Number Determine whether an integer is a palin...
【题目描述】 Check a positive number is a palindrome or not. A ...
palindrome number Determine whether an integer is a palin...
/* 注意 需要一个int值先获取x的值； 这样不会改变x的值 方便之后做比较； 判断x如果为- 直接return...
判断整数是否是回文
本文标题：Palindrome Number
本文链接：https://www.haomeiwen.com/subject/gmggwxtx.html
网友评论