typedef struct Node
{
int data;
struct Node *next;
}Node;
typedef struct Node* LinkList; //给Node* 起别名叫LinkList
LinkList creatList(LinkList head,int n) //循环链表的建立
{
LinkList p = head;
for(int i = 1;i <= n;i++)
{
LinkList q = new Node;
p->next = q;
p = q;
}
p->next = head;
return head;
}
void initList(LinkList head)
{
LinkList p = head->next;
int i = 1;
for(;p!= head;p=p->next)
{
cout<<"请输入第"<<i++<<"个元素的值:";
cin>>p->data;
}
}
void printList(LinkList head)
{
LinkList p = head->next;
int i = 1;
for(;p != head;p = p->next)
{
cout<<"第"<<i++<<"个元素的值为:";
cout<<p->data<<endl;
}
}
int main()
{
LinkList head = new Node;
head = creatList(head,3);
initList(head);
printList(head);
}