大2上作业第15章

Java151问答LinkedList结构，ArrayListJava151问答LinkedList结构，ArrayList 用HashMap<K,V>。2选择（1）（2）3编写程package第十五章作业;importjava.util.*;publicclassE{public icvoidmain(Stringargs[])stack=newk=1;while(k<={for i=1;i<=2;i++)egerF1f1=egerF2=f2=eger= eger(2*f1+ln("}}}}package第十五章作业importpublicclassEpublicicvoidmain(Stringargs[])List<Student>list=newpackage第十五章作业importpublicclassEpublicicvoidmain(Stringargs[])List<Student>list=newscore[]= Stringname[]=fori=0;i<score.length;i++)list.add(new}Iterator<Student>iter=list.iterator();TreeSet<Student>mytree=newTreeSet<Student>();while(iter.hasNext()){Studentstu=iter.next();}Iterator<Student>te=while(te.hasNext()){Studentstu=te.next();ln(""++"}}}package第十五章作业publicclassStudentimplementsComparableenglish=0;Stringname;english,Stringname)=this.english=}compareTo(Objectb)Studentst=return(this.english-}}（3）package泛型this.english=}compareTo(Objectb)Studentst=return(this.english-}}（3）package泛型classEpublicicvoidmain(Stringargs[])TreeMap<UDiscKey,UDisc>treemap=newamount[]=doubleprice[]={867,266,390,556};UDiscUDisc[]=newUDisc[4];fork=0;k<UDisc.length;k++)UDisc[k]=new}UDiscKeykey[]=newfork=0;k<key.length;key[k]=new}fork=0;k<UDisc.length;k++)treemap.put(key[k],}number=Collection<UDisc>collection=treemap.values();Iterator<UDisc>iter=collection.iterator();while(iter.hasNext()){UDiscdisc=ln(+disc.amount+"G+disc.price+"元}k=0;k<key.length;k++)key[k]=new}k=0;k<UDisc.length;k++)treemap.put(key[k],}number=collection=treemap.values();iter=collection.iterator();while(iter.hasNext()){UDiscdisc=number=collection=treemap.values();iter=collection.iterator();while(iter.hasNext()){UDiscdisc= ln(disc.amount+"G+disc.price+"元}}}package泛型publicDiscdoublem,doublee)amount=price=}}package泛型importpublicDiscKeyimplementsComparabledoublekey=UDiscKey(doubled){key=d