bob.cpp

来自「实现了一个链表的逆转,全部过程在一个链表内完成!」· C++ 代码 · 共 69 行

#include <iostream.h>
#include <stdio.h>
struct list
{
	int data;
	struct list *next;
};
list *create()
{
   struct list *h,*t,*p;
   int a;
   h=new list;
   t=h;
   t->next=NULL;
   cout<<"请输入数据(输入0结束并开始逆转你输入的数据):";
   cin>>a;
   while(a!=0)
   {
	   p=new list;
	   p->data=a;
	   t->next=p;
	   t=p;
       cout<<"请输入数据(输入0结束并开始逆转你输入的数据):";
       cin>>a;
   }
   t->next=NULL;
   return h;
}
list *change(list *h)
{
   list *p,*p1,*p2;
   p=h;
   p1=h->next;
      while(p1->next!=NULL)
   {  
	  p2=p1->next;
      p1->next=p2->next;
	  p2->next=h->next;
	  h->next=p2;
   }
   return h;
}
void main()
{
	struct list *head,*p,*p1;
	char c;
	do{
	   head=create();
	   p=head->next;
	   cout<<"你输入的数据为:";
       while(p!=NULL)
	   {
	     cout<<p->data<<" ";
         p=p->next;
	   }
       cout<<endl;
       head=change(head);
       cout<<"逆转后的数据为:";
       p1=head->next;
       while(p1!=NULL)
	   {
	     cout<<p1->data<<" ";
	     p1=p1->next;
	   }
       cout<<endl;
	   cout<<"退出程序?[Y/N]:";
	   cin>>c;
	   }while(c=='n'||c=='N');
}