2019-02-05 回文数(Palindrome number) leetcode 解题指南

题目来源

  public boolean isPalindrome(int x){
        /* 回文数 */
        boolean flag = true;
        String sx = String.valueOf(x);
        if(sx.length() == 0) return false;

        Character sign = sx.charAt(0);

        if(sign.equals('-')){
            return false;
        }
        int len = sx.length();
        StringBuilder sb = new StringBuilder(sx);
        String str2 = sb.reverse().toString();
        if(!sx.equals(str2)){
            flag = false;
        }
        return flag;
    }

• 极佳版

public static boolean isPalindrome(int x) {
        int v;
        //optimizations
        if(x<0) return false;
        if(x<10) return true;
        if(x%10==0) return false;
        if(x<100&&x%11==0) return true;
        if(x<1000&&((x/100)*10+x%10)%11==0) return true;

        //actual logic
        v=x%10;
        x=x/10;
        while(x-v>0)
        {
                v=v*10+x%10;
                x/=10;
        }
        if(v>x){v/=10;}
        return v==x?true:false;
    }