仓库管理系统 c语言 c++ 数据结构 链表 课程设计（Warehouse management system, C language, c++ data structure, link list, curriculum design）.doc

仓库管理系统 c语言 c++ 数据结构 链表 课程设计（Warehouse management system, C language, c++ data structure, link list, curriculum design） # stdio.h in # stdlib.h in # string.h in # conio.h in # define max 64 typedef struct node {/ * 定义结构体类型dnode * / int number; / * 货物编号 * / char name [max]; / * 货物名称 * / int counter 货物数量; / * * / struct node * prior, * next; / * 前驱和后继指针 * / } dnode; dnode * head = null; void output _ one (dnode * n) / * 输出一条记录 * / { printf (% d t% \ t% d \ n , n - number, n - name, n - t); } void output (输出所有记录) / * * / { dnode * pos = head; if (head = = null) { return; } while (pos) { the output _ one (pos); / * 循环调用output _ one * / pos = pos - next; } } int insert () / * 插入一条数据 * / { dnode * pos = head; dnode * n = malloc (sizeof (dnode)); n - prior = null; n - next = null; printf (请输入货物编号:); scanf (% d, n - number); printf (请输入货物名称:); scanf (% s n - name); printf (请输入货物数量:); scanf (% d, n - t); if (head = = null) / * 如果还没有头节点, 就作为头节点 * / { head = n; return 1; } while (pos) { if (pos - number n - number) / * 按顺序查找, 如果找到比自己大的, 就插在它前面 * / { if (pos - prior) pos - prior - next = n; n - prior = pos - prior; pos - prior = n; if (pos - next) pos - next - prior = n; n - next = pos; return 1; } else if (pos - number = = n - number) { free (n); return 0; / * 有重复数据, 插入不成功 * / } if (! pos - next) / * 如果已经到链表尾部, 插入到后面 * / { pos - next = n; n - prior = pos; return 1; } pos = pos - next; } return 1; } void init () { while (1) / * 初始化, 循环插入 * / { insert (a); printf (按任意键继续输入, 按esc停止输入 \ n); if (getch () = = 27) break; } } int delete () / * 删除一条记录 * / { int num; dnode * pos = head; printf (请输入要删除的编号:); scanf (% d num); if (head = = null) { return 0; } while (pos) { If (pos-number = = Num) / * * / find items matching { If (pos-prior) Pos-prior-next = pos-next; If (pos-next) Pos-next-prior = pos-prior; Free (POS); Return 1; } POS = pos-next; } Return 0; / / not found } Int (amend) / * * / change the number { Int, num, count; Dnode* POS = head; Pr