【Leetcode】Valid Palindrome JAVA

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.

这道题是说你得去掉string中所有的非英文数字字符，然后判断string是否是回文string。我这里用了个投机取巧的方法replaceAll()，否则就要分类num和char讨论，会比较麻烦，需要多次if判断。去掉后，判断是否是回文~也就是“racecar”“12321”这种。

import java.nio.charset.Charset;

public class validPalindromw {
	public static void main(String args[]){
		validPalindromw vp = new validPalindromw();
		String str=" ";
		System.out.println(vp.isPalindrome(str));
	}

		public boolean isPalindrome(String s) {
	        if(s==null||s.length()==0)
			return true;
		s=s.replaceAll("[^a-zA-Z0-9]","").toLowerCase();
		System.out.println(s);
		for(int i=0;i<s.length();i++){
			if(s.charAt(i)!=s.charAt(s.length()-1-i))
				return false;
		}
		return true;
	    }
	}