题目描述:
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) return false;
s=s.toLowerCase();
int start=0;
int end=s.length()-1;
while(start<end){
if(!Character.isLetterOrDigit(s.charAt(start))){
start++;
}else if(!Character.isLetterOrDigit(s.charAt(end))){
end--;
}else{
if(s.charAt(start)!=s.charAt(end)){
return false;
}else{
start++;
end--;
}
}
}
return true;
}
}