题目:
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.
题目分析:题目给出一个字符串s,检查s是否是回文。其中只检查字母或者数字,其它字符屏蔽不用管。字母的大小写不敏感。
思路:
- 让begin从头开始遍历s的每一个字符,让end从尾开始遍历s的每一个字符
- 当begin和end遇到非字母数字时,跳过,查找下一个
- 检查begin是否大于等于end,是的话,说明s是回文,返回true
- 否则,检查begin所在字符是否等于end所在字符(注意不区分大小写的)。是的话,begin++,end--。否则,s不是回文,返回false
注意点:
- 判断语句会很长,不要写错
代码:
public class Solution {
public boolean isPalindrome(String s) {
if (s == null){
return true;
}
int begin = 0;
int end = s.length() -1;
while (begin < end){
while ((begin <= s.length() - 1) && !((s.charAt(begin) >= 'A' && s.charAt(begin) <= 'Z') || (s.charAt(begin) >= 'a' && s.charAt(begin) <= 'z') || (s.charAt(begin) >= '0' && s.charAt(begin) <= '9'))){
begin++;
}
while ((end >= 0) && !((s.charAt(end) >= 'A' && s.charAt(end) <= 'Z') || (s.charAt(end) >= 'a' && s.charAt(end) <= 'z') || (s.charAt(end) >= '0' && s.charAt(end) <= '9'))){
end--;
}
if (begin >= end){
return true;
}
if (s.charAt(begin) != s.charAt(end) && s.charAt(begin) != s.charAt(end) + 32 && s.charAt(begin) != s.charAt(end) - 32){
return false;
}
begin++;
end--;
}
return true;
}
}