程序设计课程设计报告.docx

1、程序设计课程设计报告程序设计课程设计报告程序设计课程设计报告设计人：电气Q1142李艳平(11150038)日期：2012-11-29指导教师：桂超设计题目：链表操作一、设计任务1、创建一个单链表，并返回头结点的地址 head2、编写函数circulachain,将上述单链表改 为单循环链表3、编写函数addnode,在数据为x的结点之后插入数据为y的结点X的结点对他们从1开始编号，即1, 2, 3, n,如果从某一个人开始报数，他报数1,按顺 时针进行，紧挨的人报数2,再往下的人跟着报3,一直报到k,凡报到k的人出列, 再往下，继续从1开始报数，2, 3,，一直报到k,凡报到k的人出列。试输

2、出该 问题中顺序出列的人的名字。二、功能描述创建单循环链表函数：chain* circulchain(char*ch)销毁链表：void Destroy(chain *head) 显示链表中每个结点的数据:void Show(chain *head)插入结点函数：void AddNode(chain *head, char x, char y)删除结点函数：void DeleNode(chain *head, char x)三、程序实现1、单链表的基本操作:#include using namespace std;struct chain(char data;chain *next;chain

3、* crechain(char *ch) 创建单链表(int i;chain *head = NULL, *p = NULL, *q =NULL;for (i = 0; chi !=，0 i +) (p = new chain;p-data = chi;if (head = NULL)(head = p;)else(q-next = p;q = P；q - next = NULL;return (head); void AddNode(chain *head, char x, char y) /*插入结点*/chain *r, *s;if (head = NULL)cout链表为空!Hendl

4、;else(r = head;while (r != NULL)(if (r-data != x)(r = r-next;)else break;if (r = NULL)coutdata = y;s-next = r-next;r-next = s;void DeleNode(chain *head, char x) /* 删除结点*/(chain *p = head, *s;if (head = NULL)cout链表为空! v vendl;if (head-data = x)(head = pnext;delete p;else(while (p-next != NULL)(if (p-

5、next-data != x)p = p-next;elses = p-next;p-next = s-next;delete s;break;)void Show(chain *head) 输出链表(chain *p;p = head;while (p != NULL)coutp-data;p = p-next;)coutHnH;void Destroy(chain *head) 销毁链表chain *p;while (head != NULL)(p = head;head = pnext;delete p;)int main()(chain *head;head = crechain(Ha

6、bcdn);Show(head);AddNode(head, b, T);Show(head);DeleNode(head, c);Show(head);Destroy (head);return 0;2、单循环链表：chain* circulchain(char *ch)int i;chain *head = NULL, *p = NULL, NULL, *r;for(i = 0; chi !=，0 i +)p = new chain;p-data = chi;if (head = NULL)(head = p;)else(q - next = p;)q = p;)q - next = he

7、ad;return (head);3、约瑟夫问题：#include using namespace std;struct Joseph(char ch;Joseph *next;Joseph *head, /Joseph 结构指针，全局变void create(int n)给每个结点数据赋值(int i;Joseph *q;p = (Joseph*) malloc (sizeof(Joseph);p-ch = A;p-next = NULL;head = p;q = p;for(i = 1; i ch = A + i;将p结点加到链表尾部让q指向链表尾部结q-next = p;链表尾部指向空q

8、 = P； 点p-next = NULL;tail = q;tail-next = head;void Display(int m) 依次输出出列的人的名 字 (int x = 0;Joseph *q;q = tail;dop = q - next; /p赋值为q相邻的 下一个结点X +;if (x % m = 0)(coutn 出列的人为vvpchvvendl;q-next = p-next;delete p;p = NULL;)else q = p； q指向相邻的下一结点p)while(q != q - next); 剩余结点数不为1,则继续循环head = q;int main()int n, m;head = NULL;cout ”请输入总人数n ”;cinn;cout 请输入间隔n ; cinm;create(n);Display (m);coutvv”最后一个人是vvhead.chvvendl;delete head;return 0;