链表

链表

#include<stdio.h>#include<stdlib.h>typedef struct node {int n;struct node *next;}sqlist;void init(sqlist *&l){l=(sqlist *)malloc(sizeof(sqlist));l->next=NULL;}void insert(sqlist *&l,int e){sqlist *p=l,*q;q=(sqlist *)malloc(sizeof(sqlist));q->n=e;q->next=p->next;p->next=q;}void delet(sqlist *&l ,int N,int &x){sqlist *p=l,*q;int j=0;while(j<N&&p->next){p=p->next;j++;}q=p->next;p->next=q->next;x=q->n;}void disp(sqlist *l){sqlist *q=l;q=q->next;while(q!=NULL){printf("%d ",q->n);q=q->next;}} int main(){sqlist *l ;init(l); int n,j,x; scanf("%d",&j) ; while(j--){scanf("%d",&n);insert(l,n); }disp(l); printf("\n");delet(l,2,x);printf("%d\n",x);disp(l);printf("\n");return 0;}