实验二单链表的操作与应用..docx

南京信息工程大学实验(实习)报告实验（实习）名称单链表的操作与应用实验日期2012/11/2得分指导教师吴婷婷系计算机与软件学院专业网络工程年级2011班次1姓名管超学号20111346032单链表的操作与应用实验目的掌握线性表的单链表基本操作：建立、插入、删除、查找、合并、打印等运算。实验准备奔腾2计算机或以上机型Visual C++ 6.0实验内容百货公司库中有一批电视机，按某价格从低到高的次序构成了一个单链表并存于计算机中，链表的每一个结点指出同样价格的若干台。现在又有新到的m台价格为h元的电视机入库。编写仓库电视机链表增加电视机的算法。结点结构的定义为：typedefstruct node{int number, price;struct node *next;}list;实验代码#includestdio.h#includeconio.h#includestdlib.htypedefstruct node{int number;int price;struct node *next;}List;//初始化链表List* Init_func(List L){List *head;head = (List *)malloc(sizeof(List));if (head == NULL){printf(无法分配空间!\n);exit(0);}else{head-next = NULL;}return head;}//初始化数据voidInitData_func(List *head){List *ptr, *previous, *current;ptr = (List *)malloc(sizeof(List));if (ptr == NULL){printf(无法分配空间!);exit(0);}else{printf(\n请输入电视的价格: );scanf(%d, (ptr-price));printf(请输入库存电视台数: );scanf(%d, (ptr-number));}previous = head;current = head-next;while ((current != NULL) (current-price ptr-price)){previous = current;current = current-next;}previous-next = ptr;ptr-next = current;}//添加一个数据并进行整合voidInsert_func(List *head){List *ptr, *previous, *current;int price, number;printf(\n请输入电视的价格: );scanf(%d, price);printf(请输入电视的台数: );scanf(%d, number);previous = head;current = head-next;if (current == NULL){printf(\n库存中无电视, 正在为您添加数据...\n);ptr = (List *)malloc(sizeof(List));if (ptr == NULL){printf(无法分配空间!\n);exit(0);}else{ptr-price = price;ptr-number = number;}previous-next = ptr;ptr-next = current;printf(数据添加成功!\n);}else{while ((current != NULL) (current-price = price)){previous = current;current = current-next;}if (previous-price == price){printf(\n库存中有此价格电视, 正在为您归并...\n);previous-number += number;printf(数据归并成功!\n);}else{printf(\n库存中无此价格的电视, 正在为您添加数据...\n);ptr = (List *)malloc(sizeof(List));if (ptr == NULL){printf(无法分配空间!\n);exit(0);}else{ptr-price = price;ptr-number = number;}previous-next = ptr;ptr-next = current;printf(数据添加成功!\n);}}}//显示链表中的数据voidDisplay_func(List *head){List *current;current = head-next;if (current == NULL){printf(库存中没