33,007
社区成员
发帖
与我相关
我的任务
分享
1.
newNode->next = p->next;
p->next = newNode->next; //p->next = newNode
if(p->next)
p->next->prev = newNode; //p->next 值已变
newNode->prev = p;
2.
newNode->next = p->next;
if(p->next)
p->next->prev = newNode;
p->next = newNode;
newNode->prev = p;
3.
newNode->next = p->next;
newNode->prev = p;
if(p->next)p->next->prev = newNode;
p->next = newNode;
4.
if(p->next)
p->next->prev = newNode;
newNode->next = p->next;
p->next = newNode;
newNode->prev = p;