#include<iostream>
using namespace std;
struct node{
int data;
node *pre,*next;
};
node *head,*p,*r;
int a,b;
void insert(node *head,int i,int x)
{
node *s,*p;
int j;
s=new node;
s->data=x;
p=head;
j=0;
while((p->next!=NULL)&&(j<i))
{
p=p->next;
j=j+1;
}
if(p==NULL)
cout<<"no this position!";
else
{
s->pre=p->pre;
p->pre=s;
s->next=p;
p->pre->next=s;
}
}
int main()
{
cin>>a>>b;
int x;
head=new node;
r=head;
cin>>x;
while(x!=-1)
{
p=new node;
p->data=x;
p->next=NULL;
p->pre=r;
r->next=p;
r=p;
cin>>x;
}
insert(head,a,b);
p=head->next;
while(p->next!=NULL)
{
cout<<p->data<<" ";
p=p->next;
}
cout<<p->data<<endl;
return 0;
}
1.插入位置是 0的时候需要单独考虑
2.后面插入的逻辑不对,应该是
nide* t = p->pre;
t->next = s;
s->pre = t;
s->next = p;
p->pre = s;
您好,我是有问必答小助手,您的问题已经有小伙伴解答了,您看下是否解决,可以追评进行沟通哦~
如果有您比较满意的答案 / 帮您提供解决思路的答案,可以点击【采纳】按钮,给回答的小伙伴一些鼓励哦~~
ps:问答VIP仅需29元,即可享受5次/月 有问必答服务,了解详情>>>https://vip.csdn.net/askvip?utm_source=1146287632