数据结构 C C++ 循环链表约瑟夫问题Joseph us

约瑟夫问题，C/C++循环链表实现

VC6.0 VS2008调试通过

约瑟夫问题是个有名的问题：N个人围成一圈，从第一个开始报数，第M 个将被杀掉，最后剩下一个，其余人都将被杀掉。例如N=6，M=5，被杀掉的人的序号为5，4，6，2，3。最后剩下1号。

#include

using namespace std;

typedef struct elem//元素

{

int num;

}Person;

typedef struct link//节点

{

Person man;

struct link *next;

}Node;

typedef struct headlink//头指针

{

struct link *next;

int len;

}HeadLink;

HeadLink & InitiaList(HeadLink &head)//初始化头指针{

head.next = NULL;

head.len = 0;

return head;

}

HeadLink & Add(HeadLink & head, Person & val)//后插{

Node *p = (Node *)malloc(sizeof(Node));

if(!p)

{

cout<<"malloc failed!\n";

return head;

}

p->man = val;

if(head.len == 0)

head.next = p;

else

{

Node *q = head.next;

int temp = head.len;

while(temp != 1)

{

q = q->next;

--temp;

}

q->next = p;

}

p->next = head.next;

head.len++;

return head;

}

HeadLink & Del(HeadLink & head, Node *tp)//删除{

Node *p = head.next;

Node *q = p->next;

Node *k = NULL;

Node *ttp = tp->next;

if(head.len == 0)

{

cout<<"链表为空,操作错误!\n";

return head;

}

if(tp == head.next)

{

head.next = q;

k = head.next;

free(p);

int temp1 = head.len-1;

while(temp1 != 1)

{

k = k->next;

--temp1;

}

k->next = head.next;

}

else

{

while(p->next != tp)

{

p = p->next;

q = q->next;

}

p->next = q->next;

free(q);

}

head.len--;

head.next = ttp;

return head;

}

void Display(HeadLink &head)

{

Node *q = head.next;

int temp = 1;

while(temp <= head.len)

{

cout<man.num;

cout<

q = q->next;

++temp;

}

int main()

{

HeadLink link;

Node *p = NULL;

Person a;

int count = 0, live = 1;

int i = 0, j = 0;

InitiaList(link);

cout<<"约瑟夫问题\n";

while(1)

{

cout<<"\n请输入总人数:";

cin>>count;

cout<<"输入留下人数:";

cin>>live;

if(count <= 0)

cout<<"总人数不合法!\n";

else if(live > count)

cout<<"留下人数不能大于总人数!\n";

else if(live <= 0)

cout<<"至少留一个!\n";

else if(live > 0 && live <= count)

break;

else cout<<"未知错误!\n";

}

for(i = 1; i <= count; ++i)

{

a.num = i;

Add(link, a);

}

for( ; count != live; --count)

{

p = link.next;

for(j = 1; j <= 4; ++j)

{

p = p->next;

}

cout<man.num<<"号被KO\n";

Del(link, p);

cout<<"\n以下是留下人的序号:\n";

Display(link);

cout<

system("pause");

return 0;

}