- 这个环形链表有个恒定不变的head,head->data表示链表中的元素个数,缺点在于每删除head->next,要把head->next=head->next->next
- 要有习惯写newNode
#include <bits/stdc++.h>
using namespace std;
//link的head->data=n结点的个数
//虽然是双向,但是并没有用到双向
//不过在删除的时候可以用到,可以直接找要删除的元素
typedef struct node
{
int data;
node* next;
node* pre;
}node;
node* newNode(int i)
{
node* tmp = new node;
tmp->data = i;
tmp->next=NULL;
tmp->pre=NULL;
return tmp;
}
node* creatLink(node* head)
{
head = newNode(0);//head->data链表元素有多少个
node* p = head;
while(1){
int num;
cin>>num;
if(num==-1) break;
node* tmp = newNode(num);
p->next = tmp;
tmp->pre = p;
p = p->next;
(head->data)++;
}
if(head->next==NULL) {return head;}
p->next = head->next;//前面一直是构造非环形链表,最后构造完后再把尾指针指向头指针即可
head->next->pre = p;
return head;
}
node* deleteLink(node* head)
{
while(1){
node* p = head->next;
int num;
cin>>num;
if(num==-1) break;
int flag=1;
int deletenum = head->data;
for(int i=0;i<deletenum;i++){
if(p->data==num){
if(p==head->next){
head->next=p->next; //当要删除的元素是head->next时,还要把head->next修改
//要注意判断条件不能只是i==0,因为当i==1,2...的时候,也可能会删除head->next的元素
}
p->next->pre = p->pre;
p->pre->next = p->next;
flag=0;
(head->data)--;
}
p=p->next;
}
if(flag) cout<<-1<<endl;
}
return head;
}
void print(node* head)
{
if(head->data==0) return;
node* p = head->next;
for(int i=0;i<(head->data);i++){
cout<<p->data<<" ";
p = p->next;
}
}
int main()
{
node* head;
head = creatLink(head);
head = deleteLink(head);
print(head);
return 0;
}