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.
Two Pointers String
Solution in Java:
public class Solution {
public boolean isPalindrome(String s) {
if(s.length()==0 ||s.length()==1) return true;
String sLower = s.toLowerCase();
char[] chrS = sLower.toCharArray();
int start =0, end = chrS.length-1;
while(start<end){
if((chrS[start]<'a' || chrS[start]>'z') && (chrS[start]<'0' ||chrS[start]>'9')) start++;
else if((chrS[end]<'a'||chrS[end]>'z') && (chrS[end]<'0' || chrS[end]>'9')) end--;
else{
if(sLower.charAt(start)!=sLower.charAt(end)) return false;
start++;
end--;
}
}
return true;
}
}
Note:
注意判断其实条件,如果字符串长度为0或1,则直接返回true。
字符串变为小写:s.toLowerCase()。
虽然也可以用别的方法,但为了时间复杂度,需要用两个指针start和end来完成,因为是回文,只需比较到start>=end即可。
要求alphanumeric characters,所以在比较后如果start或end位的不符合要求,则直接移动指针。
开始时用(start!=end && (start+1)!=end)作为循环条件,发现如“ab”则不能判断,因为第一次就没进入循环。用start<end刚好,因为如果string长度为奇数,回文最中间的一位不需要比较,所以start==end时也不需要比较。