美文网首页
LeetCode每日一题:palindrome number

LeetCode每日一题:palindrome number

作者: yoshino | 来源:发表于2017-07-05 16:30 被阅读20次

    问题描述

    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 boolean isPalindrome(int x) {
            if (x < 0)
                return false;
            int div = 1;
            while (div <= x / 10)
                div *= 10;
            while (x > 0) {
                if (x / div != x % 10)
                    return false;
                x = (x % div) / 10;
                div /= 100;
            }
            return true;
        }
    

    相关文章

      网友评论

          本文标题:LeetCode每日一题:palindrome number

          本文链接:https://www.haomeiwen.com/subject/ilpqhxtx.html