LeetCode9:Palindromic Number

最新推荐文章于 2024-09-26 09:10:09 发布

huazi0204

最新推荐文章于 2024-09-26 09:10:09 发布

阅读量288

点赞数

分类专栏： LeetCode 文章标签： Leetcode leetcode LeetCode

本文链接：https://blog.csdn.net/huazi0204/article/details/8587562

版权

LeetCode 专栏收录该内容

43 篇文章 0 订阅

订阅专栏

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

public class Solution {
    public boolean isPalindrome(int x) {
        // Start typing your Java solution below
        // DO NOT write main() function
        if(x<0)
            return false;
        
        int base=1;
        while(x/base>=10){
    	    base*=10;
    	}
        
        while(x!=0){
            if(x/base != x%10)
                return false;
            x=x%base;
            x/=10;
            base/=100;
        }
        return true;
    }
}

###Recursive Solution###

public class Solution {


    private int globalX;
    
    // Forward:  curX=curX/10 until it hit 0
    // Backward: globalX=globalX/10
    
    // On the way back, least significant digit of curX and globalX
    // should always equal.
    public boolean isPalin(int curX){
        if(globalX<0) return false;
        if(curX==0) return true;
        
        if(isPalin(curX/10)
            && (curX%10==globalX%10) ){
            globalX/=10;    
            return true;
        }
        return false;
    }
    
    public boolean isPalindrome(int x) {
        globalX=x;
        return isPalin(x);
    }
}

My solution, compare from the middle to head/end:

public class Solution {
    public boolean isPalindrome(int x) {
        // Start typing your Java solution below
        // DO NOT write main() function
        if(x<0)
            return false;

        //get length: l+1
        int l = (int)(Math.log10(x));
        //odd
        if(l%2==0){
            int i = l/2;
            int pre,post;
            while(i>0){
                post = (int)(x/Math.pow(10,i-1))%10;
                pre = (int)(x/Math.pow(10,l-i+1))%10;
                if(pre!=post)
                    return false;    
                i--;
            }
            
        }
        //even
        else{
            int i = (int)Math.floor(l/2);
            int pre,post;
            while(i>=0){
                post = (int)(x/Math.pow(10,i))%10;
                pre = (int)(x/Math.pow(10,l-i))%10;
                if(pre!=post)
                    return false;    
                i--;
            }
        }
        return true;
    }
}