单向链表

#include<iostream>
#include<stdlib.h>
using namespace std; 
typedef struct Node
{
int score;
char name[10];
struct Node *next;
}node,*link;//node是Node，link是node*
int main()
{
link pnew,pold,head,temp;
    head=new node;//111 头结点初始化及赋值
if(!head)
{
cout<<"申请内存失败！"<<endl;
   return 0;
}
cout<<"请输入名字";
cin>>head->name ;
cout<<"请输入成绩";
   cin>>head->score ;
pold=head;//222  将头结点赋为pold
    for(int i=1;i<4;i++)
{
pnew=new node;// 333 为pold分配内存及赋值
if(!pnew)
{
cout<<"申请内存失败！"<<endl;
return 0;
}
cout<<"请输入名字";
cin>>pnew->name ;
cout<<"请输入成绩";
cin>>pnew->score ;
pnew->next =NULL;//444 每一个pnew的next都首先赋值为NULL，以防该节点为最后一个节点
pold->next=pnew ;//555  pnew与pold的相互转化 
pold=pnew;
}
pold=head;//666 以头节点为其实节点输出，将head转化为pold
while(pold!=NULL)
{
cout<<pold->name <<" "<<pold->score <<endl;
        temp=pold;
pold=pold->next ;
delete temp;
}
system("pause");
return 0;
}