1.HashSet:
HashSet hs = new HashSet()
hs.add("A")
hs.add("B")
hs.add("C")
hs.add("D")
sysout(hs);
结果:C A B D ------>无序的
2.LinkedHashSet
同上程序HashSet------->LinkedHashSet
结果:ABCD
3.treeSet
结果:ABCD 自动排序
4.Iterator & listItertor 迭代器
方法:
boolen hasNext()
Object next()
void remove()
ArrayList al = [A,B,C,D,E]
Iterator itr = al.iterator();
while(itr.hasNext()){
Object element = itr.next();
}
//顺序
ListIterator litr = al.listIterator();
while(litr.hasNext()){
Object element = litr.next();
}
//逆序
while(litr.hasPrevious){
Object element = litr.next();
}
结果:A B C D E
A B C D E
E D C B A