Yud*_*uda 2 java sorting collections list vector
我正在尝试Vector使用Java Collections框架对列表进行排序.
这是我的代码......
public class RiverList {
public static void main(String[] args) {
Vector<River> rivers = new Vector<River>();
//name length and discharge
River river3 = new River("Nil", 6852, 2660);
River river5 = new River("Amazonas", 6448, 209000);
River river1 = new River("Rhein", 1233, 2330);
River river4 = new River("Donau", 2857, 6700);
River river2 = new River("Oker", 128, 12);
rivers.add(river1);
rivers.add(river2);
rivers.add(river3);
rivers.add(river4);
rivers.add(river5);
System.out.println(rivers);
// sort the river after length with help class collection
System.out.println(rivers);
// sort the river after discharge with help class collection
System.out.println(rivers);
}
}
public class River {
private int length;
private int discharge;
private String name;
public River(String name, int length, int discharge) {
this.name = name;
this.length = length;
this.discharge = discharge;
}
// getters and setters
...
public String toString() {
return name + ", Length = " + length + ", discharge = " + discharge + "\n";
}
}
Run Code Online (Sandbox Code Playgroud)
这就是我所做的,但我仍然坚持如何进一步......
public class RiverLengthComparator implements Comparator {
public int compare(Object arg0, Object arg1) {
return 0;
}
}
public class RiverDischargeComparator implements Comparator {
public int compare(Object o1, Object o2) {
return 0;
}
}
Run Code Online (Sandbox Code Playgroud)
输出应该是这样的(对于河流长度)......
("Nil", 6852, 2660);
("Amazonas", 6448, 209000);
("Donau", 2857, 6700);
("Rhein", 1233, 2330);
("Oker", 128, 12);
Run Code Online (Sandbox Code Playgroud)
对于河流排放......
("Amazonas", 6448, 209000);
("Donau", 2857, 6700);
("Nil", 6852, 2660);
("Rhein", 1233, 2330);
("Oker", 128, 12);
Run Code Online (Sandbox Code Playgroud)
有人可以帮我解决这个问题.
也许你的compare方法应该返回别的东西0;)想想你想要实现什么,并阅读Comparator界面的文档.
也许使用Comparator<River>而不仅仅是Comparator第一步.
最后,您可能希望使用要使用Collections.sort(rivers, new RiverLengthComparator());的比较器.