#include <stdio.h>
#include <stdlib.h>
typedef int ElemType;
typedef struct DNode {
ElemType data; // 值
struct DNode *prior,*next; // 指向下一个结点
}DNode,*DLinklist;
//头插法
DLinklist DList_HeadInsert(DLinklist &DL){
DNode *s;
int x;
DL = (DLinklist)malloc(sizeof(DNode));
DL->prior=NULL;
DL->next=NULL;
scanf("%d",&x);
while(x!=9999){
s=(DNode*)malloc(sizeof(DNode));
s->data=x;
s->next=DL->next;
s->prior=DL;
DL->next=s;
scanf("%d",&x);
}
return DL;
}
// 尾插法
DLinklist DList_TailInsert(DLinklist &DL){
DNode *s,*pHead;
int x;
pHead = (DNode*)malloc(sizeof(DNode));
DL=pHead;
DL->prior=NULL;
DL->next=NULL;
DL->data=0;
scanf("%d",&x);
while(x!=9999){
s=(DNode*)malloc(sizeof(DNode));
s->data=x;
s->next=NULL;
s->prior=DL;
DL->next=s;
DL=s;
scanf("%d",&x);
}
return pHead;
}
//按序号查找节点值
DNode *GetElem(DLinklist &L,int i){
int j=1;
DNode *p=L->next;
if(i==0)return L;
if(i<1) return NULL;
while(p&&j<i){
p=p->next;
j++;
}
return p;
}
// 按值查找表结点
DNode *LocatElem(DLinklist &L,ElemType e) {
DNode *p=L->next;
while(p!=NULL&&p->data!=e)
p=p->next;
return p;
}
// 删除第i个结点
void *deleteNode(DLinklist &L,int i) {
DNode *p=GetElem(L,i-1);
DNode *q=p->next;
p->next=q->next;
q->next->prior=p;
free(q);
}
// 插入
void *NumberInsert(DLinklist &L,int i,ElemType e) {
DNode *p=GetElem(L,i-1);
DNode *s=(DNode*)malloc(sizeof(DNode));
s->data=e;
s->next=p->next;
p->next->prior=s;
s->prior=p;
p->next=s;
}
// 遍历双链表
void PrintList(DLinklist &DL)
{
DNode * p = DL->next;
printf("表中元素为:\n");
while(p!=NULL)
{
printf("%d\t",p->data);
p = p->next;
}
printf("\n\n");
}
int main()
{
DLinklist DL;
printf("输入链表数据,回车结束\n");
DL=DList_HeadInsert(DL);
// int i=4;
// DNode *p=GetElem(DL,i);
// printf("第%d个元素是:%d\n",i,p->data);
// int e=10;
// DNode *p=LocatElem(DL,e);
// printf("%d=%d\n",e,p->data);
PrintList(DL);
NumberInsert(DL,2,100);
// PrintList(L);
// deleteNode(DL,2);
PrintList(DL);
return 0;
}