ArrayList 排序实例

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;

public class Sort implements Comparator<String> {
private final static int UP = 1;

private final static int DOWM = -1;

private int state;

public Sort(int state) {
this.state = state;
}

public Sort() {

}

public int compare(String o1, String o2) {
if (state == Sort.DOWM) {
return sortDown(o1, o2);
}
return sortUp(o1, o2);
}

private int sortUp(String o1, String o2) {
if (o1.compareTo(o2) < 0) {
return -1;
} else if (o1.compareTo(o2) > 0) {
return 1;
} else {
return 0;
}
}

private int sortDown(String o1, String o2) {
if (o1.compareTo(o2) > 0) {
return -1;
} else if (o1.compareTo(o2) < 0) {
return 1;
} else {
return 0;
}
}

public static void main(String[] args) {
ArrayList<String> array = new ArrayList<String>();
array.add("000001");
array.add("000012");
array.add("000005");
array.add("000004");
array.add("000002");
Collections.sort(array, new Sort(Sort.UP));

for (String str : array) {
System.out.println(str);
}
String a="12345";
String b="12346";
System.out.println(b.compareTo(a));
}
}