循环链表的代码

typedef struct node {
	int val;
	struct node* next;
 }Node,*linklist;


linklist Initlist(Node* L) {
	L = (Node*)malloc(sizeof(Node));
	if (L == NULL) {
		exit(1);
	}
	else {
		L->next = NULL;
	}
	return L;
}


linklist headlist(Node* L) {
	L->next = NULL;
	int nums[4] = { 4,5,1,9 };
	Node* s;
	for (int i = 0; i < 4; i++) {
		
		s= (Node*)malloc(sizeof(Node));
		s->val = nums[i];
		s->next = L->next;
		L->next = s;
	}
	Node* t;
	t = (Node*)malloc(sizeof(Node));
	t = L->next;
	while (t->next != NULL) {
		t = t->next;
	}
	t->next = L->next;
	return L;
}//没有尾指针？

linklist Taillist(Node* L) {
	Node* s;
	Node* T;//weizhiz;
	T = L;
	int nums[4] = { 5,56,12,5 };
	for (int i = 0; i < 4; i++) {
		s = (Node*)malloc(sizeof(Node));
		s->val = nums[i];
		T->next = s;
		T = s;
	}
	T->next = L->next;


	return L;
}尾插法建循环链表