List<Node> list =new ArrayList<Node>();
Collections.sort(kdAndKnList, new LofComparator());
class LofComparator implements Comparator<Node> {
public int compare(Node A, Node B) {
return A.getLof() - B.getLof() < 0 ? -1 : 1;
}
}
从小到大进行排序
List<Node> list =new ArrayList<Node>();
Collections.sort(kdAndKnList, new LofComparator());
class LofComparator implements Comparator<Node> {
public int compare(Node A, Node B) {
return A.getLof() - B.getLof() < 0 ? -1 : 1;
}
}
从小到大进行排序