C-数据结构-单向循环链表

单向无头结点一定要注意传参 一般是二维指针问题 非常容易出错
约瑟夫算法
jose.c

#include<stdio.h>
#include<stdlib.h>
#define JOSE_NR

struct node_st
{
	int data;
	struct node_st *next;

};
struct node_st *jose_create(int n)
{
	struct node_st *me;
	struct node_st *newnode,*cur;
	int i = 1;
	
	me = malloc(sizeof(*me));
	if(me == NULL)
		return NULL;
	me->data = i;
	me->next = me; 
	i++;
	
	cur = me;
	for(;i<= n;i++)
	{	
		newnode = malloc(sizeof(*newnode));
		if(newnode = NULL)
			return NULL;
		newnode->data = i;
		newnode->data = me;	

		cur->next = newnode;
		cur = newnode;
	}
	
	return me;
}
void jose_show(struct node_st *me)
{
	struct node_st *list;
	for(list = me;list->next != me ;list=list->next)
	{
		
		printf("%d ",list->data);
		//sleep(1);
		//fflush(NULL);
	}
	printf("%d\n",list->data);

}
void jose_kill(struct node_st **me,int n)
{
	struct node_st *cur = *me,*node;
	int i=1;
	while(cur != cur->next)
	{
		while(i < n)
		{
			node = cur;
			cur = cur->next;
			i++;
		}
		printf(""%d ",cur->data);
		node->next = cur->next;
		free(cur);
		
		cur = node->next;
		i = 1;
	}
	*me = cur;
	printf("\n");
}


int main()
{
	struct node_st *list;
	int n = 3;
	list = jose_create(JOSE_NR);
	if(list == NULL)
		exit(1);
		
	jose_show(list);
	jose_kill(&list,n);
	jose_show(list);	
	
	exit(0);
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89