#include<iostream>
using namespace std;
typedef struct Node
{
int data;
struct Node *next;
}Node,*LinkList;
int CreatLinkList(LinkList L)
{
int ch;
Node *s;
Node *r;
r=L;
while(true)
{
cin>>ch;
if(ch==999)
break;
else
{
s=new Node;
s->data=ch;
r->next=s;
r=s;
}
r->next=NULL;//这句不能少了,少了就会崩溃
}
return 0;
}
int main()
{
LinkList L1;
L1=new Node;
L1->next=NULL;
CreatLinkList(L1);
Node *p;
p=L1->next;
while(p!=NULL)
{
cout<<p->data<<" ";
p=p->next;
}
return 0;
}
尾插法建表
最新推荐文章于 2022-09-16 18:29:38 发布