数据结构期末复习代码

1.停车场代码：publicclassOrderStack(inttop=-1;String[]stack;publicOrderStack(intinitcap)throwsException{if(initcap<=0){thrownewException("容量必须大于或等于1");}else{stack=newString[initcap];}}publicbooleanempty(){returntop=-1;}publicvoidpush(Stringelement){If(top==stack.length-1)System.out.println(“栈满”);Stack[++top]=element;}PublicStringpop(){If(empty())System.out.println(“栈空”);StringtopElement=stack[top];Stack[top--]=null;ReturntopElement;}publicstaticvoidmain(String[]args){try{String[]bus=newString[]{"001","002","003","004"};OrderStackos=newOrderStack(bus.length);for(inti=0;i<bus.length;i++){os.push(bus[i]);}while(os.top>-1){System.out.println(os.pop());}}catch(Exceptione){e.printStackTrace();}}}2.折半查找代码：publicclassHalfSearch{publicintBinary_Search(inta[],intk){intlow,high,mid,flag=0;low=1;high=a.length;while(low<=higth){mid=(low+higth)/2;if(k<a[mid])higth=mid-1;elseif(k>a[mid])low=mid+1;else{flag=mid;System.out.println(flag);break;}}returnflag;}publicstaticvoidmain(String[]args){int[]b={6,9,12,25,32,55,73,76,95,124};HalfSearchcl=newHalfSearch();cl.Binary_Search(b,25);}}3.一个单链表中插一个数入：//只写关键的，具体的自己在加加publicvoidinsert(LingL,intk){ p=L.head; while(k<p.getnext().data){ p=p.getnext(); } Nodenode=newNode(k); node.next=p.next; p.next=node;}4..最大公约数代码：packagepk3;classex1{intgys1(intm,intn){intk,y;if(m<n){k=m;m=n;n=k;}while(m%n!=0){y=m%n;m=n;n=y;}returnn;}publicstaticvoidmain(String[]args){ex1e1=newex1();System.out.println(e1.gys1(6,4));ex1e2=newex1();System.out.println(e1.gys2(6,4));}}5.链表的插入和删除代码：publicclassLinkNode{publicintdate=-1;publicLinkNodenext=null;publicvoidsetDate(intdate){ this.date=date;}publicvoidsetNex(LinkNodenex){ this.next=nex;}publicintgetDate(){ return(this.date)}publicLinkNodegetNext(){ return(this.next);}}publicclassLinkTable{privateLinkNodehead=null;privateintcounts=0;publicvoidinsert(intd){ if(head==null){ head=newLinkNode(); } LinkNoden=newLinkNode(); n.setDate(d); if(head.getNext()==null){ head.setNex(n); } else{ n.setNex(head.getNext()); head.setNex(n); } counts++;}publicvoidprint(){ LinkNoden=head.getNext(); intiCounter=1; while(n!=null){ System.out.print(n.getDate()+""); n=n.getNext(); iCounter++; }}publicintsize(){ returnthis.counts;}publicvoiddelete(intnum){ LinkNodep1=head; while(p1.getNext().getDate()!=num){ p1=p1.getNext(); } p1.setNex(p1.getNext().getNext()); counts--;}publicstaticvoidmain(String[]args){ LinkTablelink=newLinkTable(); link.insert(30); link.insert(40); link.insert(50); link.insert(5); link.insert(10); link.print(); System.out.println(); link.delete(10); link.print(); }}6.用递归写累加代码：importjava.io.BufferedReader;importjava.io.IOException;importjava.io.InputStreamReader;publicclassplus{ publicstaticvoidmain(String[]arg)throwsIOException{ plusp=newplus(); intn;Stringnn;InputStreamReaderir=newInputStreamReader(System.in);BufferedReaderin=newBufferedReader(ir);nn=in.readLine();n=Integer.parseInt(nn);intresult=p.add(n);System.out.print("theresultis"+":"+result); } publicintadd(intn){ intresult=0; if(n==1) {result=result+1; } else { result=n+add(n-1); } returnresult; }}7.栈实现数组逆序代码：（我只会写关键的，你们自己在改改）stacks;Nodep=L.head;While(p.next!=null){s.push(p);p=p.next;}While(!s.empty()){p.next=s.pop();p=p.next;}8.判断一个数是否为素数代码：publicclassabc{ publicstaticvoidmain(String[]args){ for(intk=1;k<=100;k++){ if(Issu(k)){ System.out.print(k+""); } } } publicstaticbooleanIssu(intn){ inti; if(n==1)returnfalse; i=(int)Math.sqrt(n); for(intj=2;j<=i;j++){ if(n%j==0)returnfalse;} returntrue}}9.在数组中加入一个数；importjava.util.Vector;publicclassabc{ publicstaticvoidmai