Java语言字符串判断是否是回文数的程序,回文数就是颠倒以后和自身相同的
private boolean judgeHW(char[] abc) {
char[] a, b;
int l = abc.length;
if (l % 2 == 0) {
a = new char[l / 2];
b = new char[l / 2];
System.arraycopy(abc, 0, a, 0, a.length);
System.arraycopy(abc, a.length, b, 0, b.length);
} else {
int m = (l - 1) / 2;
a = new char[m];
b = new char[m];
System.arraycopy(abc, 0, a, 0, a.length);
System.arraycopy(abc, m+1, b, 0, b.length);
}
return judgeHW(a, b);
}
private boolean judgeHW(char[] a, char[] b) {
boolean c = true;
for (int i = 0; i < a.length; i++) {
c &= a[i] == b[b.length - i - 1];
}
return c;
}