int InsList(LinkList L,int i,int e){
	Node *pre,*s,*p;
	int k;
	if(i<=0) printf("插入位置错误");
	pre=L;k=0;
	while(pre!=NULL&&k<i-1){
		pre=pre->next;
		k=k+1;
	}
	if(pre==NULL){
		printf("插入位置不合理");
	}
	s=(Node*)malloc(sizeof(Node));
	s->data=e;
	s->next=pre->next;
	pre->next=s;
	for(;;){
		p=L->next;
		printf("%d",p->data);
		p=p->next;
		if(p->next==NULL) break;
	}
	return OK;
}