欢迎来到天天文库
浏览记录
ID:41524301
大小:70.72 KB
页数:10页
时间:2019-08-26
《java第十一章课后习题解答》由会员上传分享,免费在线阅读,更多相关内容在工程资料-天天文库。
1、第门章常见数据结构及算法分析【1】设有一数列:a1=3,a2=8,……,an=2an_i+2an.2,使用堆栈结构输出如的若干项。[解答]:代码如下,运行程序时需要输入一个参数,指出想要输出数列的前多少项#importjava.util.Stack;publicclassStackShow{publicstaticvoidmain(String[]args){Stackst=newStack();intcount=Integer.valueOf(args[0]).intValue();inttemp;Integerfirst=newInteg
2、er(3);Integersecond=newInteger(8);st.add(first);st.add(second);for(inti=0;i3、0;for(inti=resultlength-1;i>=0;i—){System.out.print(st.pop()+nH);wanghang++;if(wanghang%5==0){System.out.println(MM);输入13吋的运行结果如下:II1183Processfinishedwithexitcode0[2]编写一程序,用哈希表实现学生成绩单的存储与查询。[解答]:学生类Student,代码如下:classStudent{privateStringno;privateStringname;privateIntege4、rscore;publicStringgetNo(){returnno;}publicvoidsetNo(Stringno){this.no=no;}publicStringgetName(){returnname;}publicvoidsetName(Stringname){this.name=name;}publicIntegergetScore(){returnscore;}publicvoidsetScore(Integerscore){this.score=score;}publicStringtoString(){return"学5、号:"+no+”姓名:"+name+”成绩:”+score;}}主类HashTest,代码如下:importjavax.swing.*;importjava.util.Vector;importjava.utiLHashtable;importjava.awt.*;C:jdk5binjava_Didea.1auncher.port=753输出这个系列的前13个数:141987754233520712879493019importjava.awt.event.ActionListener;importjava.awt.event.Acti6、onEvent;publicclassHashTestextendsJFrame{JLabellblsearchbyidorname;JTextFieldtxfidorname;JButtonbtnsearchbyidorname;JTablereader;JButtonbtnadd;JButtonbtndelete;Hashtableht;Vectorcolnames;JLabelIblno;JLabellblname;JLabelIbiscore;JTextFieldaddno;JTextFieldaddname;JTextFieldad7、dscore;Vectordata;publicHashTest()throwsHeadlessException{super(”学生成绩管理“);ht=newHashtable();lblsearchbyidomame=newJLabel("学号:H);txfidorname=newJTextField(20);Iblno=newJLabel("学号”);lblname=newJLabel(H姓名“);lblscore=newJLabel(°分数”);addno=newJTextField(lO);addname=newJTextField8、(12);addscore=newJTextField(lO);btnsearchbyidorname=newJButton(H查找->n);btnadd=newJ
3、0;for(inti=resultlength-1;i>=0;i—){System.out.print(st.pop()+nH);wanghang++;if(wanghang%5==0){System.out.println(MM);输入13吋的运行结果如下:II1183Processfinishedwithexitcode0[2]编写一程序,用哈希表实现学生成绩单的存储与查询。[解答]:学生类Student,代码如下:classStudent{privateStringno;privateStringname;privateIntege
4、rscore;publicStringgetNo(){returnno;}publicvoidsetNo(Stringno){this.no=no;}publicStringgetName(){returnname;}publicvoidsetName(Stringname){this.name=name;}publicIntegergetScore(){returnscore;}publicvoidsetScore(Integerscore){this.score=score;}publicStringtoString(){return"学
5、号:"+no+”姓名:"+name+”成绩:”+score;}}主类HashTest,代码如下:importjavax.swing.*;importjava.util.Vector;importjava.utiLHashtable;importjava.awt.*;C:jdk5binjava_Didea.1auncher.port=753输出这个系列的前13个数:141987754233520712879493019importjava.awt.event.ActionListener;importjava.awt.event.Acti
6、onEvent;publicclassHashTestextendsJFrame{JLabellblsearchbyidorname;JTextFieldtxfidorname;JButtonbtnsearchbyidorname;JTablereader;JButtonbtnadd;JButtonbtndelete;Hashtableht;Vectorcolnames;JLabelIblno;JLabellblname;JLabelIbiscore;JTextFieldaddno;JTextFieldaddname;JTextFieldad
7、dscore;Vectordata;publicHashTest()throwsHeadlessException{super(”学生成绩管理“);ht=newHashtable();lblsearchbyidomame=newJLabel("学号:H);txfidorname=newJTextField(20);Iblno=newJLabel("学号”);lblname=newJLabel(H姓名“);lblscore=newJLabel(°分数”);addno=newJTextField(lO);addname=newJTextField
8、(12);addscore=newJTextField(lO);btnsearchbyidorname=newJButton(H查找->n);btnadd=newJ
此文档下载收益归作者所有