#include <iostream>
#include <stdio.h>
#include <malloc.h>
using namespace std;
typedef struct Lnode
{
int data;
struct Lnode *next;
}Linklist;
void init(Linklist *&head)
{
head = (Linklist *)malloc(sizeof(Linklist));
head ->next=head;
}
void create(Linklist *&head,int a[],int n)
{
Linklist *r,*s;
r = head;
for(int i= 0;i <n;i++)
{
s = (Linklist *)malloc(sizeof(Linklist));
s->data = a[i];
s->next = head;
r->next = s;
r = s;
}
}
void insertlist(Linklist *&head,int i,int e)//在第i节点插入e
{
Linklist *r=head,*s;
for(int j = 0 ;j<i-1;j++)
{
r = r->next;
}
s= (Linklist *)malloc(sizeof(Linklist));
s->data = e;
s->next = r->next;
r->next =s;
}
void deletelist(Linklist *&head,int i)//删除第i个节点
{
Linklist *r= head,*q;
for(int j = 0 ; j<i-1;j++)
{
r = r->next;
}
q= r->next;
r->next =r->next->next;
free(q);
}
void dispaly(Linklist *&head)//显示
{
Linklist *r = head;
while(r->next!=head)
{
cout<<r->next->data<<" ";
r=r->next;
}
cout<<endl;
}
int main()
{
Linklist *head;
init(*&head);
int n;
cin>>n;
int a[100];
for(int i = 0;i <n;i++)
cin>>a[i];
create(*&head,a,n);
dispaly( *&head);
insertlist(*&head,2,100);
dispaly(*&head);
deletelist(*&head,2);
dispaly(*&head);
return 0;
}
#include <stdio.h>
#include <malloc.h>
using namespace std;
typedef struct Lnode
{
int data;
struct Lnode *next;
}Linklist;
void init(Linklist *&head)
{
head = (Linklist *)malloc(sizeof(Linklist));
head ->next=head;
}
void create(Linklist *&head,int a[],int n)
{
Linklist *r,*s;
r = head;
for(int i= 0;i <n;i++)
{
s = (Linklist *)malloc(sizeof(Linklist));
s->data = a[i];
s->next = head;
r->next = s;
r = s;
}
}
void insertlist(Linklist *&head,int i,int e)//在第i节点插入e
{
Linklist *r=head,*s;
for(int j = 0 ;j<i-1;j++)
{
r = r->next;
}
s= (Linklist *)malloc(sizeof(Linklist));
s->data = e;
s->next = r->next;
r->next =s;
}
void deletelist(Linklist *&head,int i)//删除第i个节点
{
Linklist *r= head,*q;
for(int j = 0 ; j<i-1;j++)
{
r = r->next;
}
q= r->next;
r->next =r->next->next;
free(q);
}
void dispaly(Linklist *&head)//显示
{
Linklist *r = head;
while(r->next!=head)
{
cout<<r->next->data<<" ";
r=r->next;
}
cout<<endl;
}
int main()
{
Linklist *head;
init(*&head);
int n;
cin>>n;
int a[100];
for(int i = 0;i <n;i++)
cin>>a[i];
create(*&head,a,n);
dispaly( *&head);
insertlist(*&head,2,100);
dispaly(*&head);
deletelist(*&head,2);
dispaly(*&head);
return 0;
}