- 在带头结点的单链表L中删除最小值点(已知最小值唯一)
遍历单链表找出最小值,并设置一个指针记录最小值的前驱结点,遍历完成后通过该指针将最小值结点删除
void Del_min(LNode *&L){
LNode *p = L->next;
LNode *pos = L;
while(p->next){
if(pos->next->data > p->next->data)
pos = p;
p = p->next;
}
LNode *u = pos->next;
pos->next = u->next;
free(u);
}
- 在不带头结点的单链表L中删除最小值点(已知最小值唯一)
通过遍历单链表,找到最小值并设置一个指针指向该最小值结点;遍历结束后,如果该最小值为单链表的开始结点,则直接将表头L= L->next,否则,遍历单链表,查找最小值结点的前驱节点,进行删除。
void del_min(LNode *&L){
LNode *p = L->next;
LNode *pos = L;
while(p){
if(pos->data > p->data)
pos = p;
p = p->next;
}
if(pos == L){
L = L->next;
free(pos);
return;
}
p = L;
while(p->next != pos)
p = p->next;
p->next = pos->next;
free(pos);
}
完整代码:
//带头结点
#include<bits/stdc++.h>
using namespace std;
typedef struct LNode{
int data;
struct LNode *next;
}LNode;
void CreateList_R(LNode *&L, int n){
L = new LNode;
L->next = NULL;
LNode *r = L;
for(int i=0; i<n; i++){
LNode *p = new LNode;
cin>>p->data;
p->next = NULL;
r->next = p;
r = p;
}
}
void Del_min(LNode *&L){
LNode *p = L->next;
LNode *pos = L;
while(p->next){
if(pos->next->data > p->next->data)
pos = p;
p = p->next;
}
LNode *u = pos->next;
pos->next = u->next;
free(u);
}
void travel(LNode *L){
LNode *p = L->next;
while(p){
cout<<p->data<<" ";
p = p->next;
}
cout<<endl;
}
int main(void){
LNode *L = new LNode;
CreateList_R(L,5);
travel(L);
Del_min(L);
travel(L);
return 0;
}
不带头结点
#include<bits/stdc++.h>
using namespace std;
typedef struct LNode{
int data;
struct LNode *next;
}LNode;
void CreateList_R(LNode *&L, int n){
L = new LNode;
cin>>L->data;
L->next = NULL;
LNode *r = L;
for(int i=1; i<n; i++){
LNode *p = new LNode;
cin>>p->data;
p->next = NULL;
r->next = p;
r = p;
}
}
void del_min(LNode *&L){
LNode *p = L->next;
LNode *pos = L;
while(p){
if(pos->data > p->data)
pos = p;
p = p->next;
}
if(pos == L){
L = L->next;
free(pos);
return;
}
p = L;
while(p->next != pos)
p = p->next;
p->next = pos->next;
free(pos);
}
void travel(LNode *L){
LNode *p = L;
while(p){
cout<<p->data<<" ";
p = p->next;
}
cout<<endl;
}
int main(void){
LNode *L = new LNode;
CreateList_R(L,5);
travel(L);
del_min(L);
travel(L);
return 0;
}