Description
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.
Note: For the purpose of this problem, we define empty string as valid palindrome.
Example
Example 1:
Input: “A man, a plan, a canal: Panama”
Output: true
Example 2:
Input: “race a car”
Output: false
Code
class Solution {
public boolean isPalindrome(String s) {
if(s == null || s.length() <= 0) {
return true;
}
//空格也要去掉
//String newStr = s.replaceAll("[^a-zA-Z0-9\\s]","").toLowerCase();
// 保留大小写字母和数字,并把大写字母转化为小写字母
String newStr = s.replaceAll("[^a-zA-Z0-9]", "").toLowerCase();
System.out.println(newStr);
int start = 0;
int end = newStr.length()-1;
while(start<end){
if(newStr.charAt(start) != newStr.charAt(end)) {
return false;
}
start++;
end--;
}
return true;
}
}