LeetCode笔记：125. Valid Palindrome

Question: （谷歌翻译）
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.
给定一个字符串，确定它是否是一个回文，只考虑字母数字字符和忽略的情况。

For example,
“A man, a plan, a canal: Panama” is a palindrome.
“race a car” is not a palindrome.

Note:
Have you consider that the string might be empty? This is a good question to ask during an interview.
你认为字符串可能是空的吗？在面试中这是一个很好的问题。

For the purpose of this problem, we define empty string as valid palindrome.
为了这个问题的目的，我们定义空字符串作为有效的回文。

Subscribe to see which companies asked this question.
订阅看看哪些公司提出这个问题。

---

Top Solutions:
该解法原理类似快速排序，忽略除字母和数字外其他字符，将String分成两边，从头至中、从尾至中比较该位置的char是否相同。

public class Solution {
    public boolean isPalindrome(String s) {
        if (s.isEmpty()) {
            return true;
        }
        int head = 0, tail = s.length() - 1;
        char cHead, cTail;
        while(head <= tail) {
            cHead = s.charAt(head);
            cTail = s.charAt(tail);
            if (!Character.isLetterOrDigit(cHead)) { //（char）头部是否为字母或数字
                head++; //不是，（char）头部向后移一位
            } else if(!Character.isLetterOrDigit(cTail)) { //（char）尾部是否为字母或数字
                tail--; //不是，（char）尾部向前移一位
            } else { //（char）头尾都为字母或数字
                if (Character.toLowerCase(cHead) != Character.toLowerCase(cTail)) { //一旦（char）头尾字母不相等，返回false
                    return false;
                }

                //（String）头尾索引+1
                head++;
                tail--;
            }
        }

        return true;
    }
}

“Accepted pretty Java solution(271ms)”
https://discuss.leetcode.com/topic/8282/accepted-pretty-java-solution-271ms/5

---

My Solution:

public class Solution {
    public boolean isPalindrome(String s) {
        String ss = s.toLowerCase();
        List<Character> leftList = new ArrayList<Character>(), rightList = new ArrayList<Character>();

        char[] c = ss.toCharArray();

        for(int i = 0; i < c.length; i++) {
            if( (c[i] >= 'a' && c[i] <= 'z') || (c[i] >= 'A' && c[i] <= 'Z') || (c[i] >= '0' && c[i] <= '9') )
                leftList.add( c[i] );
        }
        for(int i = c.length - 1; i >= 0; i--) {
            if( (c[i] >= 'a' && c[i] <= 'z') || (c[i] >= 'A' && c[i] <= 'Z') || (c[i] >= '0' && c[i] <= '9') )
                rightList.add( c[i] );
        }
        if(leftList.equals(rightList))
            return true;
        return false;
    }
}