问题:
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.
解决:
【注】
这道题的几个点,
一就是要判断的是alphanumeric characters and ignoring cases,字母和数字,忽略大小写,忽略其它字符。
二就是考虑空字符串是否为回文,这里是认为空字符串是回文(具体问题具体分析)。
① 因为忽略大小写,所以就统一为大写。使用双指针分别指向字符串的头部和尾部然后就判断当前检查字符是否符合范围,否则大小指针挪动。如果发现有大小指针指向的值有不同的,就返回false,否则,继续检查。最后返回true。
public class Solution {//14 ms
public boolean isPalindrome(String s) {
if(s.length() == 0) return true;
s = s.toUpperCase();
int low = 0;
int high = s.length() - 1;
while(low < high){
if((s.charAt(low) < '0' || s.charAt(low) > '9')
&& (s.charAt(low) < 'A' || s.charAt(low) > 'Z')){
low ++;
continue;
}
if((s.charAt(high) < '0' || s.charAt(high) > '9')
&& (s.charAt(high) < 'A' || s.charAt(high) > 'Z')){
high --;
continue;
}
if (s.charAt(low) == s.charAt(high)) {
low ++;
high --;
}else{
return false;
}
}
return true;
}
}
② 使用Character类的isLetterOrDigit方法。
public class Solution {//8 ms
public boolean isPalindrome(String s) {
int len = s.length();
if (len == 0) {
return true;
}
int low = 0;
int high = len - 1;
while (low <= high) {
if (! Character.isLetterOrDigit(s.charAt(low))) {
low ++;
continue;
} else if (! Character.isLetterOrDigit(s.charAt(high))) {
high --;
continue;
} else if (Character.toLowerCase(s.charAt(low)) != Character.toLowerCase(s.charAt(high))) {
return false;
}
low ++;
high --;
}
return true;
}
}