93 lines
1.3 KiB
C++
93 lines
1.3 KiB
C++
#include <iostream>
|
|
using namespace std;
|
|
|
|
typedef struct LNode
|
|
{
|
|
int data;
|
|
struct LNode *next;
|
|
} LNode, *LinkList;
|
|
|
|
// 头插法
|
|
void HeadInsert(LinkList &L)
|
|
{
|
|
int val = 0;
|
|
while (cin >> val)
|
|
{
|
|
LNode *s = new LNode;
|
|
s->data = val;
|
|
s->next = L->next;
|
|
L->next = s;
|
|
|
|
if (cin.get() == '\n')
|
|
{
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
// 尾插法
|
|
void TailInsert(LinkList &L)
|
|
{
|
|
int val = 0;
|
|
LNode *r = L;
|
|
while (cin >> val)
|
|
{
|
|
LNode *s = new LNode;
|
|
s->data = val;
|
|
r->next = s;
|
|
r = s;
|
|
r->next = NULL;
|
|
|
|
if (cin.get() == '\n')
|
|
{
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
// 遍历输出链表元素
|
|
void Print(LinkList L)
|
|
{
|
|
LNode *p = L->next;
|
|
while (p)
|
|
{
|
|
cout << p->data << '\t';
|
|
p = p->next;
|
|
}
|
|
cout << endl;
|
|
}
|
|
|
|
void DelMinValue(LinkList &L)
|
|
{
|
|
// 工作节点
|
|
LNode *p, *pre;
|
|
p = L->next, pre = L;
|
|
|
|
// 用于保存最值的节点
|
|
LNode *minP, *minPre;
|
|
minP = p, minPre = pre;
|
|
|
|
while (p)
|
|
{
|
|
if (p->data < minP->data)
|
|
{
|
|
minPre = pre;
|
|
minP = p;
|
|
}
|
|
|
|
pre = p;
|
|
p = p->next;
|
|
}
|
|
|
|
minPre->next = minP->next;
|
|
delete minP;
|
|
}
|
|
|
|
int main()
|
|
{
|
|
LinkList L = new LNode;
|
|
TailInsert(L);
|
|
|
|
DelMinValue(L);
|
|
Print(L);
|
|
} |