#include <stdio.h>#include <malloc.h>//循環(huán)鏈表 typedef struct node {	int num;	node* next;} NODE;NODE* fool;//尾結(jié)點 int lenght = -1;//鏈表的長度 NODE* create_node(int num) {	NODE* n = (NODE*) malloc(sizeof(NODE));	n->num = num;	n->next = NULL;	lenght++;	return n;}void PRint(NODE* head, int index) {	NODE* p = head->next;	int j = 0;	while (p != NULL && j <= index) {		p = p->next;	    j++;	}	j = 0;	while (p != NULL) {		printf("%d ", p->num);		p = p->next;		j++;		if (j >= lenght) {		    return;		}	}	printf("/n");}int main() {	NODE* head = create_node(-1);//頭結(jié)點 	NODE* p = head;			for (int i = 0; i < 10; i++) {		p->next = create_node(i);		p = p->next;		fool = p;	}		fool->next = head->next;// 使鏈表的首位相連 		print(head, 3);//指定從鏈表的第幾個位置開始遍歷 		return 0;}