Palindrome Number
Determine whether an integer is a palindrome. Do this without extra space.
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?
There is a more generic way of solving this problem.
这道题定义负数不是回文数,也即小于0的数可以不用考虑。
这道题我想到了三种思路:
第一种思路:
取数字的最高位和最低位,然后相比较,若不同,则返回false,并且将原数字减去已经判断过的部分,然后继续循环判断。
代码如下:
<pre name="code" class="cpp">class Solution
{
public:
bool isPalindrome(int x)
{
if(x < 0)
return false;
//注意:按照下面这么写的话,base是越界了的,例如测试用例1000000001。
//int base = 10;
//while(x/base)
//{
// base *= 10;
//}
//base /= 10;
int base = 1;
while(x/base>=10)
{
base *= 10;
}
int left = 0;
int right = 0;
while(x)
{
left = x / base;
right = x % 10;
if(left != right)
return false;
x = (x - left*base - right)/10;
base /= 100;
}
return true;
}
};
第二种思路:
将数字进行翻转,如果翻转后结果与原始结果相同,则为回文数。
翻转过程中,虽然会出现溢出的情况,但是如果溢出,则该数必定不是回文数。回文数翻转后还是自身的。
class Solution
{
public:
bool isPalindrome(int x)
{
if(x < 0)
return false;
int reverse = 0;
int temp = x;
while(temp)
{
reverse = reverse*10 + temp%10;
temp /= 10;
}
return reverse == x;
}
};
第三种思路:
将数字转换为字符串,然后逐位比较字符串中的字符
#include <cstdlib>
class Solution
{
public:
bool isPalindrome(int x)
{
if(x < 0)
return false;
string str;
itoa(x,str);
len = str.length();
for(int i=0; i<len/2; i++)
{
if(str[i]!=str[len-i-1])
return false;
}
return true;
}
};
注意:这个代码是有问题的!报出的错误是编译不通过,语法错误!
提示是:Line 11: 'itoa' was not declared in this scope
看这意思是不想让我们用itoa函数了。