c++ 自定义链表的使用

 数据结构-链表的基本操作 - C语言网

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <time.h>

typedef int T;
typedef struct LNode{
	T data;
	struct LNode *next;
}LNode,*List;

int gete(List &l,int i,int &e){
	List p;
	p=l->next;
	int j=1;
	while(p&&j<i){
		p=p->next;
		++j; 
	}
	if(!p||j>i)return 0;
	e=p->data;
	return 1;
}

int ins(List &l,int i,int e){//i>=1 <=n
	List p,s;
	p=l;
	int j=0;
	while(p&&j<i-1){
		p=p->next;
		++j;
	}
	if(!p||j>i-1)return 0;
	s=(List)malloc(sizeof(LNode));
	s->data=e;
	s->next=p->next;
	p->next=s;
	return 1;
}

int del(List &l,int i){
	List p,q;
	p=l;
	int j=0;
	while(p->next&&j<i-1){
		p=p->next;
		++j;
	}
	if(p->next==NULL||j<i-1)return 0;
	q=p->next;
	p->next=q->next;
	free(q);
	return 1;
}

void travel(List &l){
	List p=l;
	p=p->next;
	if(p==NULL){
		printf("Link list is empty\n");
		return;
	}
	while(p){
		printf("%d ",p->data);
		p=p->next;
	}
	printf("\n");
}

char s[114514];

int main() {
	List p=(List)malloc(sizeof(LNode));
	p->next=NULL;
	int n;scanf("%d",&n);
	for(int i=0;i<n;i++){
		int x;scanf("%d",&x);
		ins(p,1,x);
	}
	int q;scanf("%d",&q);
	while(q--){
		scanf("%s",s);
		int x,v;
		if(*s=='d'){
			scanf("%d",&x);
			if(del(p,x))printf("delete OK\n");
			else printf("delete fail\n");
		}else if(*s=='i'){
			scanf("%d %d",&x,&v);
			if(ins(p,x,v))printf("insert OK\n");
			else printf("insert fail\n");
		}else if(*s=='g'){
			int e;
			scanf("%d",&x);
			if(gete(p,x,e))printf("%d\n",e);
			else printf("get fail\n");
		}else{
			travel(p);
		}
	}
}