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 1:
Input: "A man, a plan, a canal: Panama" Output: true
Example 2:
Input: "race a car" Output: false
class Solution {
public boolean isPalindrome(String s) {
if(s == null || s.isEmpty()) {
return true;
}
int begin =0;
int end = s.length()-1;
while(begin < end) {
while(begin<end && !(Character.isLetterOrDigit(s.charAt(begin)))) {
begin++;
}
while(end>begin && !(Character.isLetterOrDigit(s.charAt(end)))) {
end--;
}
if(begin == end) {
return true;
}
if(begin < end && s.substring(begin, begin+1).toLowerCase().equals(s.substring(end, end+1).toLowerCase())) {
begin++;
end--;
continue;
}else {
return false;
}
}
return true;
}
}