leetcode 125——验证回文串

一.筛选+判断

Character.isLetterOrDigit()：确定指定的字符是否为字母或数字，是的话返回true
Character.toLowerCase()：将大写字符转换为小写
StringBuffer(sgood).reverse()：将字符串反转

class Solution 
{
    public boolean isPalindrome(String s) 
    {
        StringBuffer sgood = new StringBuffer();
        int length = s.length();

        for (int i = 0; i < length; i++) 
        {
            char ch = s.charAt(i);

            if (Character.isLetterOrDigit(ch))  
            {
                sgood.append(Character.toLowerCase(ch));
            }
        }

        StringBuffer sgood_rev = new StringBuffer(sgood).reverse();   

        return sgood.toString().equals(sgood_rev.toString());   //比较两字符串的值是否相等
    }
}

二.双指针

class Solution 
{
    public boolean isPalindrome(String s) 
    {
        StringBuffer sgood = new StringBuffer();
        int length = s.length();