由网友(你都不值得我洗头)分享简介:我如何检查,如果一个号码是回文?How do I check if a number is a palindrome?任何语言。任何算法。 (除了使数字的字符串,然后反向串的算法)。Any language. Any algorithm. (except the algorithm of making the n...
我如何检查,如果一个号码是回文?
How do I check if a number is a palindrome?
任何语言。任何算法。 (除了使数字的字符串,然后反向串的算法)。
Any language. Any algorithm. (except the algorithm of making the number a string and then reversing the string).
推荐答案
对于任何给定民:
n = num;
rev = 0;
while (num > 0)
{
dig = num % 10;
rev = rev * 10 + dig;
num = num / 10;
}
如果ñ==转
然后 NUM
是回文:
cout << "Number " << (n == rev ? "IS" : "IS NOT") << " a palindrome" << endl;
相关推荐
最新文章