题目:Determine whether an integer is a palindrome. Do this without extra space.
Some hints:
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.
Subscribe to see which companies asked this question
想法:不可以转换成String型,不可以倒转数,那就直接得数位,利用高位和地位的取余计算得法
class Solution {
public:
bool isPalindrome(int x) {
if(x<0)return 0;
int n=0,temp=x,big=1,small=1;
while(temp!=0) // 取数位
{
n++;
temp/=10;
if(temp)big*=10;
}
for(int i=0;i
题目比较基础,应该属于面试中的送分题!