LeetCode9，125验证回文串 双指针 反转字符串

1双指针

    char[] chars = String.valueOf(num).toCharArray();
        int i=0;
        int j=chars.length-1;
        while (j>=i){
            if(chars[i]!=chars[j])
            {
                return false;
            }
            j--;
            i++;
        }

        return true;

2 反转数字

 private static boolean product(int num) {
        if (num < 0 || (num % 10 == 0 && num != 0)) {
            return false;
        }
        int revert=0;
        while (num>revert){
            revert= revert*10+num%10;
            num/=10;
        }
        return revert==num||revert/10==num;
    }

125 Character.isLetterOrDigit 数字或字符

 public boolean isPalindrome(String s) {
        StringBuilder builder = new StringBuilder();
        int length = s.length();
        for (int i = 0; i < length; i++) {
            char ch = s.charAt(i);
            if (Character.isLetterOrDigit(ch)) {
                builder.append(Character.toLowerCase(ch));
            }
        }
        StringBuilder reverse = new StringBuilder(builder).reverse();
        return builder.toString().equals(reverse.toString());
    }