Java判断一个字符串能否在顺序重组后成为回文串

public class Test2 {

public static void main(String args[]) {
int result = huiwen("level");
if(result == 1) {
System.out.println("是回文串 ");
} else {
System.out.println("不是回文串 ");
}
}

private static int huiwen(String str) {
int len = str.length();
int i, j, x = 1, m = 0;
char[] strs = str.toCharArray();
if (len % 2 == 0) {
for (i = 0; i < len; i++) {
int sum = 0;
for (j = 0; j < len; j++) {
if (strs[i] == strs[j])
sum++;
}
if (sum % 2 != 0) {
x = 0;
break;
}
}
if (x == 0)
return 0;
else
return 1;

} else {
for (i = 0; i < len; i++) {
int sum = 0;
for (j = 0; j < len; j++) {
if (strs[i] == strs[j])
sum++;
}
if (sum % 2 != 0) {
m++;
}
}
if (m > 1)
return 0;
else
return 1;

}
}

}