有个需求,字符串中有很多数字,需要按照最后的数字排序,使用Java原生排序发现11会排在2前面,呈现是XXXX1,XXXX11,XXXX2这样,于是找了找解决方案,记录一下
/**
* @Version 1.0
* @Author:zly
* @Date:2023/4/18
* @Content: java排序混乱的字符串字母和数字排序,解决11在2前面
*/
public class NaturalOrderComparator implements Comparator {
int compareRight(String a, String b) {
int bias = 0;
int ia = 0;
int ib = 0;
// The longest run of digits wins. That aside, the greatest
// value wins, but we can't know that it will until we've scanned
// both numbers to know that they have the same magnitude, so we
// remember it in BIAS.
for (; ; ia++, ib++) {
char ca = charAt(a, ia);
char cb = charAt(b, ib);
if (!Character.isDigit(ca) && !Character.isDigit(cb)) {
return bias;
} else if (!Character.isDigit(ca)) {
return -1;
} else if (!Character.isDigit(cb)) {
return +1;
} else if (ca < cb) {
if (bias == 0) {
bias = -1;
}
} else if (ca > cb) {
if (bias == 0)
bias = +1;
} else if (ca == 0 && cb == 0) {
return bias;
}
}
}
public int compare(Object o1, Object o2) {
String a = o1.toString();
String b = o2.toString();
int ia = 0, ib = 0;
int nza = 0, nzb = 0;
char ca, cb;
int result;
while (true) {
// only count the number of zeroes leading the last number compared
nza = nzb = 0;
ca = charAt(a, ia);
cb = charAt(b, ib);
// skip over leading spaces or zeros
while (Character.isSpaceChar(ca) || ca == '0') {
if (ca == '0') {
nza++;
} else {
// only count consecutive zeroes
nza = 0;
}
ca = charAt(a, ++ia);
}
while (Character.isSpaceChar(cb) || cb == '0') {
if (cb == '0') {
nzb++;
} else {
// only count consecutive zeroes
nzb = 0;
}
cb = charAt(b, ++ib);
}
// process run of digits
if (Character.isDigit(ca) && Character.isDigit(cb)) {
if ((result = compareRight(a.substring(ia), b.substring(ib))) != 0) {
return result;
}
}
if (ca == 0 && cb == 0) {
// The strings compare the same. Perhaps the caller
// will want to call strcmp to break the tie.
return nza - nzb;
}
if (ca < cb) {
return -1;
} else if (ca > cb) {
return +1;
}
++ia;
++ib;
}
}
static char charAt(String s, int i) {
if (i >= s.length()) {
return 0;
} else {
return s.charAt(i);
}
}
public static void main(String[] args) {
String[] strings = new String[]{"zzdvlp_test__007-zzdvlp_test__008/75-1",
"zzdvlp_test__007-zzdvlp_test__008/75-11",
"zzdvlp_test__007-zzdvlp_test__008/75-2"};
List orig = Arrays.asList(strings);
System.out.println("Original: " + orig);
List scrambled = Arrays.asList(strings);
Collections.shuffle(scrambled);
System.out.println("Scrambled: " + scrambled);
Collections.sort(scrambled, new NaturalOrderComparator());
System.out.println("Sorted: " + scrambled);
}
运行结果为
Original: [zzdvlp_test__007-zzdvlp_test__008/75-1, zzdvlp_test__007-zzdvlp_test__008/75-11, zzdvlp_test__007-zzdvlp_test__008/75-2]
Scrambled: [zzdvlp_test__007-zzdvlp_test__008/75-11, zzdvlp_test__007-zzdvlp_test__008/75-1, zzdvlp_test__007-zzdvlp_test__008/75-2]
Sorted: [zzdvlp_test__007-zzdvlp_test__008/75-1, zzdvlp_test__007-zzdvlp_test__008/75-2, zzdvlp_test__007-zzdvlp_test__008/75-11]
OK,符合要求