/*现在要用treeset
第一种比较性是让元素具有比较性
自定义的对象没有比较性,我们要让对象实现comparable 覆盖comparaTo
*/
//存储对象进入TREEset集合,并且里面有重覆元素
package pack;
import java.util.*;
class Student implements Comparable
{
private String name;
private int age;
Student(String name,int age)
{
this.name=name;
this.age=age;
}
public int compareTo(Object obj)
{
return -1;
}
public String getName()
{
return name;
}
public int getAge()
{
return age;
}
}
class TreeSetDemo
{
public static void main(String[] args)
{
TreeSet t=new TreeSet();
t.add(new Student("lisi",20));
t.add(new Student("lisi",20));
t.add(new Student("lisi1",20));
Iterator it=t.iterator();
while(it.hasNext())
{
Student stu=(Student)it.next();
System.out.println(stu.getName()+"...."+stu.getAge());
}
}
}
第一种比较性是让元素具有比较性
自定义的对象没有比较性,我们要让对象实现comparable 覆盖comparaTo
*/
//存储对象进入TREEset集合,并且里面有重覆元素
package pack;
import java.util.*;
class Student implements Comparable
{
private String name;
private int age;
Student(String name,int age)
{
this.name=name;
this.age=age;
}
public int compareTo(Object obj)
{
return -1;
}
public String getName()
{
return name;
}
public int getAge()
{
return age;
}
}
class TreeSetDemo
{
public static void main(String[] args)
{
TreeSet t=new TreeSet();
t.add(new Student("lisi",20));
t.add(new Student("lisi",20));
t.add(new Student("lisi1",20));
Iterator it=t.iterator();
while(it.hasNext())
{
Student stu=(Student)it.next();
System.out.println(stu.getName()+"...."+stu.getAge());
}
}
}