数据结构大作业01课程设计

publicstaticvoidmain(Stringargs[]){Windowwindow=newWindow();}}b:importjavax.swing.*;importjava.awt.*;importjava.awt.event.ActionEvent;publicclass主体部分extendsWindow{publicstaticvoidmain(Stringargs[]){Windowwindow=new}}预期结果：s=09.a：importjavax.swing.*;importjava.awt.*;importjava.awt.event.ActionEvent;publicclass主体部分extendsWindow{publicstaticvoidmain(Stringargs[]){Windowwindow=new}}b:publicinterfaceLList<T>{booleanisEmpty();intlength();Tget(inti);voidset(inti,Tx);voidinsert(inti,Tx);Tsearch(Tkey);}预期结果：s=5.385c=29publicclassSinglyLinkedList<T>implementsLList<T>{publicNode<T>head;publicSinglyLinkedList(){this.head=newNode<T>();}publicSinglyLinkedList(T[]element){{}}publicbooleanisEmpty()return}publicintlength(){inti=0;}return}publicTget(inti){for(intj=0;p!=null&&j<i;j++)return}return}publicvoidset(inti,Tx){return;for(intj=0;p!=null&&j<i;j++)}elsethrownewIndexOutOfBound}publicvoidinsert(inti,Tx){for(intj=0;p.next!=null&&j<i;j++)p.next=new}publicvoidappend(Tx){}publicTsearch(Tkey){returnNode<T>p=this.head.next;returnp.date;}return} String{Stringstr="(";}return}}b:importjava.util.Hashtable;publicclassStringCount{HashSet<String>hash=newHashSet<String>();int[]count=newint[100];publicint[]add(inti){this.count[i]+=1;returncount; publicStringCount(Stringtext){ Strings1=text.rece("(","").rece(")","").rece("[","").rece("]","").rece("{","").rece("}","").rece(";","").rece(".","").rece("“","").rece("”","").rece("\n","");String[]str1=s1.trim().split("");for(inti=0;i<str1.length;{//System.out.println(str1[i]);HashSet<String>k=newHashSet<String>();intm=k.hash(str1[i]);} 预期结果 publicclassSinglyLinkedList<T>implementsLList<T>{publicNode<T>head;publicSinglyLinkedList(){this.head=newNode<T>();}publicSinglyLinkedList(T[]element){for(int{rear.next=newNode<T>(element[i],null);}}publicclassNode<T>{publicTdate;publicpublicNode(Tdate,Node<T>next){}publicclassHashSet<T> publicHashSet(intsize){for(inti=0;i<table.length;i++)}publicHashSet(){}publicinthash(Treturnkey%table.length;}publicvoidinsert(T}importjavax.swing.*;importjava.awt.*;importjava.awt.event.ActionEvent;importpublicclass主体部分extendsWindow{publicstaticvoidmain(Stringargs[]){Windowwindow=new}}窗口操importimportjava.awt.event.ActionEvent;importjava.awt.event.ActionListener;importjavax.swing.*;publicclassWindowextendsJFrameimplementsActionListener{JButtonbutton,b;JTextFieldf,f1;JTextAreaA1,A2;JLabell1,l2,l3,l4;publicWindow(){(char,do,double,if,import,extends,void,static..)比较程序相似性");setBounds(100,100,800,l1=newJLabel("第一段程序：");l3=newJLabel("第二段程序：");JPanelpanel3=newJPanel();panel3.setLayout(newGridLayout(1,2));A1=newJTextArea();A2=newJTextArea();JPanelpanel=newJPanel();panel.setLayout(newGridLayout(1,2));panel.add(newJScrollPane(A1));panel.add(newJScrollPane(A2));l2=newJLabel("相似度S(越小越相似)=");button=newJButton("测试");f=newJTextField(20);f1=newJTextField(10);l4=newJLabel("关键字差异次数");JPanelpane2=newJPanel();pane2.setLayout(newFlowLayout());b=newJButton("清空");}publicvoidisEmpty(int[]M,int[]N){inta=0,b=0;for(inti=0;i<M.length;i++)for(inti=0;i<N.length;i++),"}}publicvoidactionPerformed(ActionEvente){StringStringCountco1=newStringCount(s1);int[]arr1=newint[100];//for(int//StringStringCountco2=newStringCount(s2);int[]arr2=newint[100];//for(int//System.out.println(arr1[i]);ints=0;doubles3=0;for(inti=0;i<arr1.length;i++){intm=(arr1[i]-arr2[i]);}Stringn=Double.toString(s3);}}}importjava.util.Hashtable;publicclassStringCount{HashSet<String>hash=newHashSet<String>();int[]count=newint[100];publicint[]add(inti){this.count[i]+=1;returncount;}publicStringCount(String{ for(int Strings1=text.rece("(","").rece(")","").rece("[","").rece("]","").rece("{","").rece("}","").rece(";","").rece(".","").rece("“","").rece("”","").rece("\n","");String[]str1=s1.trim().split("");for(inti=0;i<str1.length;{//System.out.println(str1[i]);HashSet<String>k=newHashSet<String>();intm=k.hash(str1[i]);Stringl=hash.table[m].toString();} Windowwindow=newpublicclassSinglyLinkedList<T>implementsLList<T>{HashSet<String>hash=newpublicStringCountco1=new 对一整段程序不能进行与哈希表中的关键字比 通过采用程序中分隔符将程序将程序中分割后的单词由于类型不匹配而不能进行比较-----tostring()方法无法知道关键字在哈希表中的位 利用每步输出和打断点最终得到了关键字哈希表中的关键字取哈希值取余后产生-----通过改变哈希表的长度和利用单链表六、javajavajavajavas=s=s=6.782329983125268importjavax.swing.*;importjava.awt.*;importjava.awt.event.ActionEvent;publicclass主体部分extendsWindow{publicstaticvoidmain(Stringargs[]){Windowwindow=new}}publicinterfaceLList<T>{booleanisEmpty();intlength();Tget(intvoidset(inti,Tx);voidinsert(inti,Tx);Tsearch(Tkey);}publicclassSinglyLinkedList<T>implementsLList<T>{publicNode<T>head;publicSinglyLinkedList(){this.head=newNode<T>();}publicSinglyLinkedList(T[]element){for(int{}}publicbooleanisEmpty()return}publicintlength(){inti=0;{}return}publicTget(inti){for(intj=0;p!=null&&j<i;j++)return}return}publicvoidset(inti,Tx){return;for(intj=0;p!=null&&j<i;j++)}}publicvoidinsert(inti,Tx){for(intj=0;p.next!=null&&j<i;j++)p.next=new}publicvoidappend(Tx){}publicTsearch(Tkey){returnNode<T>p=this.head.next;returnp.date;}return} String{Stringstr="(";{}}}importpublicclassStringCountHashSet<String>hash=newHashSet<String>();int[]count=newint[100];publicint[]add(inti){this.count[i]+=1;returncount;}{ for(int Strings1=text.rece("(","").rece(")","").rece("[","").rece("]","").rece("{","").rece("}","").rece(";","").rece(".","").rece("“","").rece("”","").rece("\n","");for(inti=0;i<str1.length;{//System.out.println(str1[i]);HashSet<String>k=newHashSet<String>();intm=k.hash(str1[i]);}}}publicclassNode<T>{publicTdate;publicpublicNode(T}public}}publicclassHashSet<T> SinglyLinkedList<T>[]table;publicHashSet(intsize){for(inti=0;i<table.length;i++)}publicHashSet(){}publicinthash(Treturnkey%table.length;}publicvoidinsert(T}publicTsearch(Treturn}publicbooleancontain(Tkey){}publicStringtoString(){Stringstr="";for(inti=0;i<table.length;i++)}}importimportjava.awt.event.ActionEvent;importjavax.swing.*;publicclassWindowextendsJFrameimplementsActionListener{JButtonbutton,b;JTextFieldf,f1;JLabell1,l2,l3,l4;publicthis.setTitle("根据java关键字(char,do,double,if,import,extends,void,static..)比较程序相 setBounds(100,100,800,l1=newJLabel("第一段程序：");l3=newJLabel("第