回文字符串判断
package com.pxj.cuanfa05;
public class PalindromeString {
public static void main(String[] args) {
}
public static boolean IsChar(char c){
return (c>='a' && c<='z') || (c>='A' && c<='Z') || (c>='0' && c<='9');
}
public static boolean Capital(char a, char b){
if(a>='A' && a<='Z') a+=32;
if(b>='A' && b<='Z') b+=32;
return a==b;
}
public static boolean PalindromeStringa(String s){
if(s==null || s.length()==0){
return false;
}
int i=0;int j=s.length()-1;
for(;i<j;++i,--j){
while (i<j && !IsChar(s.charAt(i))) ++i;
while (i<j && !IsChar(s.charAt(j)))--j;
if(i<j && !Capital(s.charAt(i),s.charAt(j))) return false;
}
return true;
}
}
作者:pxj
2021-03-08
仅献给远方的你,愿君安好!