首页 > 其他 > 详细

9. Palindrome Number

时间:2016-09-08 00:56:54      阅读:269      评论:0      收藏:0      [点我收藏+]

1. 问题描述

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.
Tags: Math
Similar Problems: (E) Palindrome Linked List

2. 解题思路


3. 代码

class Solution {
public:
    bool isPalindrome(int x)
    {
        if (x < 0)
        {
            return false;
        }

        int len = 1;
        for (; (x/len) >= 10; len *= 10);

        while (0 != x) 
        {
            int left = x / len;
            int right = x % 10;

            if(left != right)
            {
                return false;
            }

            x = (x%len) / 10;
            len /= 100;
        }
        return true;
    }
};

4. 反思

9. Palindrome Number

原文:http://www.cnblogs.com/whl2012/p/5851461.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!