class Solution {
public boolean isPalindrome(String s) {
if(s.length()==0) return true;
// 把所有字母和数字复制到新字符串builder中,并转换为小写
StringBuilder builder = new StringBuilder();
for(int i=0;i<s.length();i++){
char ch =s.charAt(i);
if(Character.isLetterOrDigit(ch)){
builder.append(Character.toLowerCase(ch));
}
}
// 开始双指针判断,一旦出现不匹配的情况就返回错误。如果到最后都未出现匹配失败就返回true
int left=0,right=builder.length()-1;
while(left<right){
if(builder.charAt(left)!=builder.charAt(right)){
return false;
}
left++;
right--;
}
return true;
}
}
判断回文串java
最新推荐文章于 2023-07-11 14:41:14 发布