★约瑟夫问题(Josephus Problem)——C++代码实现★.pdfVIP

约瑟夫问题 （Josephus Problem ） ——C++代码实现 /* * 约瑟夫问题描述：已知n个人（以编号,2,3,……,n分别表示）围坐在一张圆桌周围。 * 从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从开始报数，数到m * 的那个人又出列；依此规律重复下去，直至圆桌周围的人全部出列。 * * 注：题目来自《程序员面试宝典（第二版）》欧立奇等著,电子工业出版社,2008.1 */ #include iostream #include stdlib.h // for system(PAUSE) #include assert.h // for assert() using namespace std; // circular linked list node type typedef struct _C_NODE{ int data; struct _C_NODE *next; }C_NODE, *PC_NODE; // Josephus Problem solution void Josephus(int n, int k, int m) { cout Josephus parameter(n,k,m): n , k , m endl; // create a circular linked list(1...n) PC_NODE clist = NULL; PC_NODE current = NULL; PC_NODE temp = NULL; temp = new C_NODE; assert(temp != NULL); temp-data = 1; clist = current = temp; current-next = clist; cout create node temp-data ; for(int i=2; i=n; i++) { temp = new C_NODE; assert(temp != NULL); temp-data = i; temp-next = current-next; current-next = temp; current = temp; cout temp-data ; } cout endl; // find node k PC_NODE previous = current; // NOTE:previous point to the tail of list in case of k=1 current = clist; // NOTE:current point to the head of list assert(k = 1); while(--k) { previous = current; current = current-next; } // delete node k+m-1 circularly cout delete node ; while(n--) { for(int j=1; jm; j++) { previous = current; current = current-next; } previous-next = current-next; cout current-data ; delete current; current = previous-next; } cout endl; } // start from here i