9. Palindrome Number

原题

Determine whether an integer is a palindrome. Do this without extra space.

click to show spoilers.

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.

代码实现

        public bool IsPalindrome(int x)
        {
            int palindromex = 0, tmp = x;
            int sumbit = 0;
            //calcuate bit count
            while (tmp > 0)
            {
                sumbit++;
                tmp /= 10;
            }
            tmp = x;
            //get a number reversely
            while (tmp > 0)
            {
                //if palindromex happens overflow, it would return false;
                palindromex += tmp % 10 * (int)System.Math.Pow(10, --sumbit);               
                tmp /= 10;
            }
            return palindromex == x;
        }

leetcode-solution库

leetcode算法题目解决方案每天更新在github库中，欢迎感兴趣的朋友加入进来，也欢迎star，或pull request。https://github.com/jackzhenguo/leetcode-csharp