#include
#include
using namespace std;
struct NODE
{
int data;
NODE *nextnode;
};
NODE *CLaddend(NODE *head,int dt)
{
NODE *nodete,*htemp;
nodete=new NODE;
nodete->data=dt;
if (head==NULL)
{
head=nodete;
return head;
}
else
{
htemp=head;
while (htemp->nextnode!=NULL) htemp=htemp->nextnode;
htemp->nextnode=nodete;
return head;
}
}
void SHOWnode(NODE *head)
{
NODE *htemp;
htemp=head;
while (htemp->nextnode!=NULL)
{
cout<data< htemp=htemp->nextnode;
}
}
int main()
{
NODE *nodehead;
nodehead=NULL;
int dat;
cin>>dat;
while (dat!=0)
{
nodehead=CLaddend(nodehead,dat);
}
SHOWnode(nodehead);
}
代码如上,非常简单的生成链表和输出链表