动态数据结构聊边的变量不是通过类型标识符定义,而是程序运行时如果需要在想系统申请。变量所占用的内存单元不一定是连续存放的。整体所占的统建随元素的个数变化而变化,从而减少了空间的浪费。
链表的用途:1、用来代替数组元素个数不定的数组;
2、在数据库管理程序中用来对磁盘文件的存储操作。
用代码的形式,简单介绍一下单链表
建立一个职工单链表,包括工号、姓名、工资等信息。
#include<stdio.h>
#include<stdlib.h>
struct Worker{
int num;
char name[20];
float pay;
struct Worker *next;
};
main(){
struct Worker *p,*q,*head;
q=p=head=(struct Worker*)malloc(sizeof(struct Worker));
scanf("%d%s%f",&p->num,p->name,&p->pay);
p = (struct Worker*)malloc(sizeof(struct Worker));//申请新的节点连接到q指针的后面
scanf("%d%s%f",&p->num,p->name,&p->pay);
q->next = p;
q = p;
p = (struct Worker*)malloc(sizeof(struct Worker));
scanf("%d%s%f",&p->num,p->name,&p->pay);
q->next = p;
q = p;
q->next = 0;
p = head;
while(p != 0){ //输出链表
printf("%d%s%f\n",p->num,p->name,p->pay);
p = p->next;
}
}
双链表,一个节点有两个指针,一个指向前面的节点,一个指向它后面的节点。
用双链表实现上面功能
#include <stdio.h>
#include <stdlib.h>
struct Worker{
int num;
char name[20];
float pay;
struct Worker *next;
struct Worker *pre;
};
main(){
struct Worker *head,*p,*q;
head=q=p=(struct Worker*)malloc(sizeof(struct Worker));
scanf("%d%s%f",&p->num,p->name,&p->pay);
p->pre = 0;
p=(struct Worker*)malloc(sizeof(struct Worker));
scanf("%d%s%f",&p->num,p->name,&p->pay);
p->pre = q;
q->next = p;
q = p;
p=(struct Worker*)malloc(sizeof(struct Worker));
scanf("%d%s%f",&p->num,p->name,&p->pay);
q->next = p;
p->pre = q;
q = p;
p->next = 0;
while(q != 0){//从后往前输出
printf("%d %s %0.1f\n",q->num,q->name,q->pay);
q = q->pre;
}
p = head;
while(p != 0){//从前往后输出
printf("%d %s %0.1f\n",p->num,p->name,p->pay);
p = p->next;
}
}