数据结构经典题目及c语言代码要点.docVIP

《数据结构》课程设计题目 (程序实现采用C语言) 题目1：猴子选王（学时：3） 一堆猴子都有编号，编号是1，2，3 ...m，这群猴子（m个）按照1-m的顺序围坐一圈，从第1开始数，每数到第个，该猴子就要离开此圈，这样依次下来，直到圈中只剩下最后一只猴子，则该猴子为大王。//链表 #include stdio.h #include stdlib.h // typedef struct _RingNode { int pos; struct _RingNode *next; }RingNode, *RingNodePtr; // 创建约瑟夫环，pHead:，count:void CreateRing(RingNodePtr pHead, int count) { RingNodePtr pCurr = NULL, pPrev = NULL; int i = 1; pPrev = pHead; while(--count 0) { pCurr = (RingNodePtr)malloc(sizeof(RingNode)); i++; pCurr-pos = i; pPrev-next = pCurr; pPrev = pCurr; } pCurr-next = pHead; // 构成环状链表 } void KickFromRing(RingNodePtr pHead, int n) { RingNodePtr pCurr, pPrev; int i = 1; // 计数 pCurr = pPrev = pHead; while(pCurr != NULL) { if (i == n) { // printf(\n%d, pCurr-pos); // 显示出圈循序 pPrev-next = pCurr-next; free(pCurr); pCurr = pPrev-next; i = 1; } pPrev = pCurr; pCurr = pCurr-next; if (pPrev == pCurr) { // 最后一个 printf(\nKing is %d, pCurr-pos); // 显示出圈循序 free(pCurr); break; } i++; } } int main() { int n = 0, m = 0; RingNodePtr pHead = NULL; printf(M(person count) = ); scanf(%d, m); printf(N(out number) = ); scanf(%d, n); if(m = 0 || n = 0) { printf(Input Error\n); return 0; } // 建立链表 pHead = (RingNodePtr)malloc(sizeof(RingNode)); pHead-pos = 1; pHead-next = NULL; CreateRing(pHead, m); // 开始出圈 printf(\nKick Order: ); KickFromRing(pHead, n); printf(\n); system(pause); return 0; } //数组做： #includestdio.h #includestdlib.h #includestring.h void SelectKing(int MonkeyNum, int CallNum); void main() { int MonkeyNum; int CallNum; /* 输入猴子的个数 */ printf(Monkey Num = ); scanf(%d, MonkeyNum); /* 输入M的值 */ p