创建和删除链表
来源:互联网 发布:青岛建站seo 编辑:程序博客网 时间:2024/05/16 14:08
#include<iostream.h>
#include<stdio.h>
#include<stdlib.h>
struct person
{
char name[31];
int age;
char address[101];
struct person * next;
};
struct person *createlink();
void printlink(struct person * pt);
void distroylink(struct person *linkhead);
void main()
{
struct person * linkhead;
linkhead=createlink();
printlink(linkhead);
distroylink(linkhead);
}
struct person *createlink()
{
struct person *linkhead,*linkend,*pt;
int i;
cout<<"input name age address:\n";
for(i=0;i<3;i++)
{
pt=(struct person *)malloc(sizeof(struct person));
cin>>pt->name>>pt->age>>pt->address;
if(i==0)
{
linkhead=pt;
linkend=pt;
}
else
{
linkend->next=pt;
linkend=pt;
}
}
linkend->next=NULL;
return linkhead;
}
void printlink(struct person *pt)
{
while(pt!=NULL)
{
cout<<pt->name<<pt->age<<pt->address<<"\n";
pt=pt->next;
}
}
void distroylink(struct person *linkhead)
{
struct person *pt;
int i=0;
pt=linkhead;
while(pt!=NULL)
{
linkhead=linkhead->next;
free(pt);
cout<<"free node :"<<"\n";
pt=linkhead;
}
}
#include<stdio.h>
#include<stdlib.h>
struct person
{
char name[31];
int age;
char address[101];
struct person * next;
};
struct person *createlink();
void printlink(struct person * pt);
void distroylink(struct person *linkhead);
void main()
{
struct person * linkhead;
linkhead=createlink();
printlink(linkhead);
distroylink(linkhead);
}
struct person *createlink()
{
struct person *linkhead,*linkend,*pt;
int i;
cout<<"input name age address:\n";
for(i=0;i<3;i++)
{
pt=(struct person *)malloc(sizeof(struct person));
cin>>pt->name>>pt->age>>pt->address;
if(i==0)
{
linkhead=pt;
linkend=pt;
}
else
{
linkend->next=pt;
linkend=pt;
}
}
linkend->next=NULL;
return linkhead;
}
void printlink(struct person *pt)
{
while(pt!=NULL)
{
cout<<pt->name<<pt->age<<pt->address<<"\n";
pt=pt->next;
}
}
void distroylink(struct person *linkhead)
{
struct person *pt;
int i=0;
pt=linkhead;
while(pt!=NULL)
{
linkhead=linkhead->next;
free(pt);
cout<<"free node :"<<"\n";
pt=linkhead;
}
}
0 0
- 创建和删除链表
- 链表创建,显示,删除和倒置
- 双向链表的创建和删除
- 创建,修改和删除表
- mysql创建和删除表
- mysql创建和删除表
- mysql创建和删除表
- 创建、修改和删除表
- 创建,修改和删除表
- mysql创建和删除表
- 创建和删除表空间
- mysql创建和删除表
- 链表的创建和删除,初识链表
- 链表的创建,插入,删除,和输出
- 链表的创建,插入,删除和输出
- 链表的创建、插入、删除、排序和逆置
- 链表的创建,插入,删除和打印
- C++链表的创建和插入删除的实现
- POJ 1269 Intersecting Lines
- matlab 做中值滤波时K = filter2(fspecial('average',3),J)/255,为什么要除以255
- 求最大公约数
- 1033. To Fill or Not to Fill
- 辛星解读iptables的常用参数及其值
- 创建和删除链表
- Received my new Lenovo Thinkpad X1 carbon
- 冒泡排序法
- 开窗函数,视图,事务,存储过程,索引,触发器,游标
- 【BZOJ2326】【HNOI2011】数学作业 分段矩阵乘法
- hdu 2874 Connections between cities
- 求m,n间的素数
- HDU 1247 Hat’s Words
- 有效地加载大尺寸位图(Loading Large Bitmaps Efficiently)