按位查找(带头结点)
//按位查找,返回第i个元素
LNode * GetElem(LinkList L,int i){
if(i<0)
return NULL;
LNode *p;
int j=0;
p = L;
while(p!=NULL && j<i){
p = p->next;
j++;
}
return p;
}
平均时间复杂度:O(n)
改写按位插入(带头结点)
bool ListInsert(LinkList &L,int i,ElemType e){
LNode *p = GetElem(L,i-1);//找到第i-1个元素
return InsertNextNode(p,e);//插入
}
按值查找(带头结点)
LNode * LocateElem(LinkList L,ElemType e){
LNode *p = L->next;
while(p!=NULL && p->data!=e)
p = p->next;
return p;
}
平均时间复杂度:O(n)
求长度(带头结点)
int Length(LinkList L){
int len = 0;
LNode *p = L;
while(p->next != NULL){
p = p->next;
len++;
}
return len;
}
平均时间复杂度:O(n)
尾插法建立单链表(带头结点)
LinkList List_TailInsert(LinkList &L){
int x;
L = (LinkList)malloc(sizeof(LNode));
LNode *s,*r = L;
scanf("%d",&x);
while(x!=9999){
s = (LNode *)malloc(sizeof(LNode));
s->data = x;
r->next = s;
r = s;
scanf("%d",&x);
}
r->next = NULL;
return L;
}
平均时间复杂度:O(n)
头插法建立单链表(带头结点)
应用:链表逆置
LinkList List_HeadInsert(LinkList &L){
LNode *s;
int x;
L = (LinkList)malloc(sizeof(LNode));
L->next = NULL;//不加,最后一个元素会指向一个未知内存
scanf("%d",&x);
while(x!=9999){
s = (LNode *)malloc(sizeof(LNode));
s->data = x;
s->next = L->next;
L->next = s;
scanf("%d",&x);
}
return L;
}
头插法建立单链表(不带头结点)
LinkList List_HeadInsert(LinkList &L){
{
LNode *s,*p;
int x;
L = (LinkList)malloc(sizeof(LNode));
L->next = NULL;
scanf("%d",&x);
L->data = x;
scanf("%d",&x);
while(x!=9999){
s = (LNode *)malloc(sizeof(LNode));
s->next = NULL;
s->data = x;
p = s;
s = L;
L = p;
L->next = s;
scanf("%d",&x);
}
return L;
}