10.Palindrome Number

本文介绍两种不使用额外空间判断整数是否为回文的方法。一种是将整数转化为字符串进行对比;另一种通过数学方式逐位比较最高位与最低位是否相同。讨论了负数情况及整数反转可能带来的溢出问题。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

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.

Solution: nagative and less than 10 non-nagative poistions are be specially processed.

So1: use String,more easy way.

public class Solution {
    public boolean isPalindrome(int x) {
        if (x < 0) {
            return false;
        }
        else if (x>=0 && x<=9) {
            return true;
        }
        else{
            String a = String.valueOf(x);
            int i = 0;
            int j = a.length()-1;
            while(i<j){
                if(a.charAt(i)!=a.charAt(j)){
                    return false;
                }
                i++;
                j--;
            }
            return true;
        }
    }
}


So2: use int. each time select highest one and lowest one to judge whether they are the same. be careful the detail.

public class Solution {
    public boolean isPalindrome(int x) {
        if (x < 0) {
            return false;
        }
        else if (x>=0 && x<=9) {
            return true;
        }
        else {
            int base = 1;
            int k = x;
            int t = 0;
            while (true) {
                t = k/10;
                if (t == 0) {
                    break;
                }
                else {
                    base *=10;
                }
                k = k/10;
            }
            
            while(x>0) {
                int low = x%10;
                int high = x/base;
                if (low != high) {
                    return false;
                }
                x = x%base;
                base = base/100;//头和尾都去掉,是除以100
                x = x/10;
            }
            return true;
            
        }
    }
}


 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值