Valid Palindrome 检查是否是有效的回文 @LeetCode

题目：

检查一个字符串是否是有效的回文

思路：

左右指针，跳过无需检查的字符，然后比较所指的字符是否相等

package Level2;

/**
 * Valid Palindrome
 * 
 * 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.
 */
public class S125 {

	public static void main(String[] args) {
		String s = ".;.;..;{,";
		System.out.println(isPalindrome(s));
	}
	
	// 原来递归对于太长字符串会StackOverflow!改成迭代通过
	public static boolean isPalindrome(String s) {
		if(s==null || s.length()==0 || s.length()==1){
        	return true;
        }
        int i = 0, j = s.length()-1;
        
        while(i <= j){
        	// Java中用Character.isLetterOrDigit 来检查是否是alphanumeric
        	// 过滤掉whitespace等无需检查的字符
        	while(i<s.length() && !Character.isLetterOrDigit(s.charAt(i))){
            	i++;
            }
            while(j>=0 && !Character.isLetterOrDigit(s.charAt(j))){
            	j--;
            }
            // 注意检查可能已经越界的问题！
            if(i<s.length() && j>=0 && Character.toLowerCase(s.charAt(i)) != Character.toLowerCase(s.charAt(j))){
            	return false;
            }
            i++;
            j--;
        }
        
        return true;
	}

}

其实不用检查越界问题，因为当不满足i<=j时候就退出while，而i和j已经控制住左右的边界了。

public class Solution {
    public boolean isPalindrome(String s) {
        if(s == null || s.length() <= 1) {
            return true;
        }
        
        s = s.toLowerCase();
        int left = 0, right = s.length()-1;
        while(left <= right) {
            if(!Character.isLetterOrDigit(s.charAt(left))) {
                left++;
            } else if(!Character.isLetterOrDigit(s.charAt(right))) {
                right--;
            } else if(s.charAt(left) != s.charAt(right)) {
                return false;
            } else {
                left++;
                right--;
            }
        }
        
        return true;
    }
}