数据结构期末复习代码.docVIP

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;ibus.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(ka[mid])

higth=mid-1;

elseif(ka[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(kp.getnext().data){

p=p.getnext();

}

Nodenode=newNode(k);

node.next=p.next;

p.next=node;

}

4..最大公约数代码：

packagepk3;

classex1

{

intgys1(intm,intn)

{

intk,y;

if(mn){

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;