本文共 1001 字，大约阅读时间需要 3 分钟。

#include <iostream>

#include<stdlib.h> using namespace std; typedef struct student {  int data;  struct student *pre;  struct student *next; }node; node *creat() {  int cycle=1,x;  node *head,*p,*s;  head=(node*)malloc(sizeof(node));  p=head;  while(cycle)  {   s=(node*)malloc(sizeof(node));   cout<<"please input one number"<<endl;   cin>>x;   if(x!=0)   {   s->data=x;   s->pre=p;   p->next=s;   p=s;   }   else cycle=0;  }  head=head->next;  head->pre=NULL;  p->next=NULL;  return (head); } void visit(node *head) {  node *p;  p=head;  while(p!=NULL)  {     cout<<p->data<<endl;   p=p->next;  }

}

node* del(node *head,int num) {  node *p;  p=head;  while(p->data!=num&&p->next!=NULL)  {   p=p->next;  }  if(p->data==num)  {   if(p==head)   {    head=head->next;    head->pre=NULL;    free(p);   }   else if(p->next==NULL)   {    p->pre->next=NULL;     free(p);   }   else   {    p->pre->next=p->next;    p->next->pre=p->pre;   }  }  else  {  cout<<"the number cannot found"<<endl;  }  return (head); } void main() {  node *head;  head=creat();  visit(head);  head=del(head,5);  cout<<endl;  visit(head); }

转载地址：https://blog.csdn.net/limuzi13/article/details/8049142 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！