约瑟夫循环问题

#include <iostream>
#include <stdlib.h>
using namespace std;

typedef struct LNode
{
	int data;
	struct LNode *next;
}LNode, *LinkList;

int josephu(int m, int n)
{
	LinkList p, curr;
	p = (LinkList)malloc(sizeof(LNode));
	p->data = 1;
	p->next = p;
	curr = p;

	for(int i = 1;i < n; i++)
	{
	    LinkList tmp = (LinkList)malloc(sizeof(LNode));
		tmp->data = i + 1;
		tmp->next = curr->next;
		curr->next = tmp;
		curr = tmp;
	}
	while(n--)
	{
		LinkList tmp;
		for (int s=m-1;s--;tmp=p,p=p->next);
		tmp->next=p->next;
		cout<<p->data<<"->";
		free(p);
		p=tmp->next;
	}
	return 0;
}

int main()
{
	josephu(4,17);
	return 0;
}

参考链接：

http://www.voidcn.com/article/p-axekcpuy-tq.html

https://segmentfault.com/a/1190000015932138