判断回文串，判断回文数

public boolean isPalindrome(String s){
char[] cs = s.toCharArray();
int cnt = 0,j = 0;
for(int i = 0; i < cs.length ; i++){
	if( '0' <= cs[i] && cs[i] <='9' || ('a' <= cs[i] && cs[i] <= 'z')){
		cs[cnt++] = cs[i];
	}else if( 'A' <= cs[i] && cs[i] <= 'Z'){
		cs[cn++] = (char)(cs[i] -'A'+'a')
	
	}


}
 	  cnt--;
  	  int i = 0;
      while(i < cnt) {
	if(cs[i++] != cs[cnt--]) {
 		return false;
  	}
  }
 return true;

}

	 public boolean isPalindrome(int x) {
		 
		 if(x < 0 || (x%10 == 0 && x!= 0)) {
			 return false;
		 }
		 int revertedNumber = 0;     
		 while(x > revertedNumber) {
			 revertedNumber = revertedNumber * 10 + x % 10;
			 x /= 10;
		 }
		 
		System.out.println(revertedNumber);
		 return x== revertedNumber || x== revertedNumber / 10;
	 }

长度为奇数：

长度为偶数