cpp1.cpp

米缸问题用队列求解

#include <stdio.h>
typedef struct LNode{
	int data; 
    struct LNode *next;
}LNode,*LinkList;
void mer_L(LinkList A,LinkList B,LinkList C){
	LNode *pa,*pb,*q;
    pa=A->next;pb=B->next;
    C=A;A->next=NULL;
while(pa&&pb){
 if(pa->data<=pb->data){
  q=pa;pa=pa->next;q->next=C->next;C->next=q;}
 else{q=pb;pb=pb->next;q->next=C->next;C->next=q;}}
if(pa!=NULL){while(pa!=NULL){q=pa;pa=pa->next;
    q->next=C->next;C->next=q;}}
if(pb!=NULL){while(pb!=NULL){q=pb;pb=pb->next;
         q->next=C->next;C->next=q;}}
}
LNode *creatlist()
{ LNode *head,*r,*s;
  int x;
  head=new LNode;
  r=head;
  printf("input :");
  scanf("%d",&x);
  while(x != 0)
  {s=new LNode;
   s->data=x;
   r->next=s;
   s->next=NULL;
   r=s;
   printf("input :");
   scanf("%d",&x);
  }
  return(head);
}
void main()
{
 LinkList a,b,c,p;
 a=creatlist();
 b=creatlist();
 c= new LNode;
 mer_L(a,b,c);

 p=c->next;
 while(p)
 { 	 
	 printf("%d",p->data);
	 p=p->next;
 }
}