链表操作（删除链表中的一个结点）

#include<iostream>using namespace std;typedef struct node{int number;struct node *next;}Node;Node *Delete(Node *head,int key){Node *node1=head;Node *node2=NULL;if (head==NULL){return NULL;} else{if (node1->number==key){head=head->next;free(node1);return head;} else{while (node1!=NULL){node2=node2->next;if(node2 != NULL){if (node2->number==key){node1->next=node2->next;free(node2);break;}node1=node1->next;}else{break;}}return head;}}}