link能不能解决约瑟夫环的问题？C#+link去解决？？？
http://www.cnblogs.com/ziyiFly/archive/2008/09/10/1288105.html
http://tieba.baidu.com/p/2432947278
你参考一下c语言版本的
#include
8 #include
9
10 // 链表节点
11 typedef struct _RingNode
12 {
13 int pos; // 位置
14 struct _RingNode *next;
15 }RingNode, *RingNodePtr;
16
17 // 创建约瑟夫环，pHead:链表头指针，count:链表元素个数
18 void CreateRing(RingNodePtr pHead, int count)
19 {
20 RingNodePtr pCurr = NULL, pPrev = NULL;
21 int i = 1;
22 pPrev = pHead;
23 while(--count > 0)
24 {
25 pCurr = (RingNodePtr)malloc(sizeof(RingNode));
26 i++;
27 pCurr->pos = i;
28 pPrev->next = pCurr;
29 pPrev = pCurr;
30 }
31 pCurr->next = pHead; // 构成环状链表
32 }
33
34 void PrintRing(RingNodePtr pHead)
35 {
36 RingNodePtr pCurr;
37 printf("%d", pHead->pos);
38 pCurr = pHead->next;
39 while(pCurr != NULL)
40 {
41 if(pCurr->pos == 1)
42 break;
43 printf("\n%d", pCurr->pos);
44 pCurr = pCurr->next;
45 }
46 }
47
48 void KickFromRing(RingNodePtr pHead, int m)
49 {
50 RingNodePtr pCurr, pPrev;
51 int i = 1; // 计数
52 pCurr = pPrev = pHead;
53 while(pCurr != NULL)
54 {
55 if (i == m)
56 {
57 // 踢出环
58 printf("\n%d", pCurr->pos); // 显示出圈循序
59 pPrev->next = pCurr->next;
60 free(pCurr);
61 pCurr = pPrev->next;
62 i = 1;
63 }
64 pPrev = pCurr;
65 pCurr = pCurr->next;
66 if (pPrev == pCurr)
67 {
68 // 最后一个
69 printf("\n%d", pCurr->pos); // 显示出圈循序
70 free(pCurr);
71 break;
72 }
73 i++;
74 }
75 }
76
77 int main()
78 {
79 int m = 0, n = 0;
80 RingNodePtr pHead = NULL;
81 printf("---------------Josephus Ring---------------\n");
82 printf("N(person count) = ");
83 scanf("%d", &n);
84 printf("M(out number) = ");
85 scanf("%d", &m);
86 if(n <= 0 || m <= 0)
87 {
88 printf("Input Error\n");
89 system("pause");
90 return 0;
91 }
92 // 建立链表
93 pHead = (RingNodePtr)malloc(sizeof(RingNode));
94 pHead->pos = 1;
95 pHead->next = NULL;
96 CreateRing(pHead, n);
97 #ifdef _DEBUG
98 PrintRing(pHead);
99 #endif
100
101 // 开始出圈
102 printf("\nKick Order: ");
103 KickFromRing(pHead, m);
104 printf("\n");
105 system("pause");
106 return 0;
107 }