given
public class Drink implements Comparable {
public String name;
public int compareTo(Objcet o){
return 0;
}
and:
Drink one = new Drink();
Drink two = new Drink();
one.name="Coffee";
two.name="Tea";
TreeSet set = new TreeSet();
set.add(one);
set.add(two);
A programmer iterates over the TreeSet and prints the name of each Drink object.
What is the result?
public class Drink implements Comparable {
public String name;
public int compareTo(Objcet o){
return 0;
}
and:
Drink one = new Drink();
Drink two = new Drink();
one.name="Coffee";
two.name="Tea";
TreeSet set = new TreeSet();
set.add(one);
set.add(two);
A programmer iterates over the TreeSet and prints the name of each Drink object.
What is the result?
如果,你是想让name的值进行排序的话
你Drink实现了Comparable 必须重写compareTo具体怎么写,上网很多,自己去看看吧
TreeSet就认为放进去的两个大小是相同的。这个题,主要是考Comparable 接口。
因为返回0 所以就一个coffee?
那为什么是coffee 不是tea呢?
可以再讲得详细点么?
因为它用compareTo比较是否相同,这样,后面的Drink都无法添加进set将return 0改为其它值就会得到不同结果
但不管怎样COFFEE都应在TEA之前输出啊,TreeSet是按照自然排序的