存储特点:有序,不重复;key不能为空,value可以为null
(总结一点:凡是有Tree的集合,都是有序的,凡是有Set的就是不重复的)
public class Test {
public static void main(String[] args) {
TreeSet set = new TreeSet();
set.add(3);
set.add(2);
set.add(5);
set.add(1);
set.add(3);
System.out.println(set);
}
}
输出
[1, 2, 3, 5]
public boolean isEmpty():判断集合是否为空
public Iterator<E> iterator() :迭代输出
demo
public class Test {
public static void main(String[] args) {
TreeSet set = new TreeSet();
Person person = new Person("古天乐",18);
set.add(person);
set.add(new Person("胡歌",22));
set.add(new Person("刘亦菲",11));
set.add(new Person("周星驰",16));
set.add(new Person("李连杰",56));
Iterator iterator = set.iterator();
while(iterator.hasNext()){
System.out.println(iterator.next());
}
}
}
输出
Person{name='刘亦菲', age=11}
Person{name='周星驰', age=16}
Person{name='古天乐', age=18}
Person{name='胡歌', age=22}
Person{name='李连杰', age=56}