容器经验总结 文档.docxVIP

容器:(1136)1.一个图2.一个类:java.Util.Collections3.三个知识点:增强for循环泛型Generic Auto-boxing/unboxing(自动打包/解包)4.六个接口:collection set list map iterator comparable*(Array读快改慢;Linked改快读慢;Hash两者之间)一个图Collection:package Collections;importjava.util.*;publicclassBasicContainer {publicstaticvoid main(String[] args){Collection c=newHashSet();c.add(hello);c.add(new Name(f1,l1));c.add(new Integer(100));c.remove(new Integer(100));System.out.println(c.remove(new Name(f1,l1)));System.out.println(c);}}class Name implements Comparable{private String firstName,lastName;public Name(String firstName,StringlastName){this.firstName=firstName;this.lastName=lastName;}public String getFirstName(){returnfirstName;}public String getLastName(){returnlastName;}public String toString(){returnfirstName+ +lastName;}publicboolean equals(Object obj){if(objinstanceof Name){Name name=(Name)obj;return (firstName.equals(name.firstName))(lastName.equals(name.lastName));}returnsuper.equals(obj);}publicinthashCode(){returnfirstName.hashCode();}publicintcompareTo(Object o){Name n=(Name)o;intlastCmp=lastNpareTo(n.lastName);return (lastCmp!=0?lastCmp:firstNpareTo(n.firstName));}}Iterator:package Collections;importjava.util.*;publicclassTestIterator {publicstaticvoid main(String[] args){Collection c=newHashSet();c.add(new Name(f1,l1));c.add(new Name(f2,l2));c.add(new Name(f3,l3));Iterator i=c.iterator();while(i.hasNext()){//Next的返回类型为Object类型，需要强制类型转化Name n=(Name)i.next();System.out.print(n.getFirstName()+ );}}}增强for循环:package Collections;importjava.util.*;publicclassEnhancedFor {//增强forpublicstaticvoid main(String[] args){int[] arr={1,2,3,4,5};for(int i:arr){System.out.println(i);}Collection c=newArrayList();c.add(new String(aaa));c.add(new String(bbb));c.add(new String(ccc));for(Object o:c){System.out.println(o);}}}List:package Collections;importjava.util.*;publicclass TestList1 {publicstaticvoid main(String[] args){List l1=newLinkedList();for(int i=0;i=5;i++){l1.add(a+i);}System.out.println(l1);l1.add(3, a100);System.out