leetcode:Palindrome Number （判断数字是否回文串） 【面试算法题】

题目:

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.

题意判断数字是否是回文串，只能用常数空间，不能转换成字符串，不能反转数字。

先计算数字的位数，分别通过除法和取余，提取出要对比的对应数字。

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<n/2;++i)

        {

            if((x/big)%10!=(x/small)%10)return 0;

            big/=10;

            small*=10;

        }

        return 1;

    }

};

//   http://blog.csdn.net/havenoidea

leetcode:Palindrome Number （判断数字是否回文串） 【面试算法题】的相关教程结束。