科目 | 内容 | 补充 | 时间 |
---|---|---|---|
数学 | 第二章开头 | 10、72、74-78、86 |
6.有一个带头结点的单链表L,设计一个算法使其元素递增有序
bool increase_sort(LinkList &L) //断链重排,实现递增
{
LNode *pre, *p, *r;
r = L->next;
p = r->next;
r->next = NULL;
while (p != NULL)
{
r = p;
p = p->next;
pre = L;
while (pre->next != NULL && pre->next->data < r->data)//把while错写if,找了俩小时错在哪,我是傻逼
pre = pre->next;
r->next = pre->next;
pre->next = r;
}
return true;
}
7.设一个带表头节点的单链表中所有元素节点的数据无序,试编写一个函数,删除表中所有介于给定两个值(作为函数参数给出)之间的元素的元素(若存在)
#include <malloc.h>
#include <stddef.h>
#include <stdio.h>
typedef struct LNode
{
int data;
struct LNode *next;
} LNode, *LinkList;
bool InitList(LinkList &L)
{
L = NULL;
return true;
}
LinkList List_TailInsert(LinkList &L)
{
int x;
L = (LNode *)malloc(sizeof(LNode));
L->next = NULL;
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;
}
void printlist(LinkList L)
{
LNode *t;
t = L->next;
while (t != NULL)
{
printf("%d", t->data);
t = t->next;
}
}
void DeleteElem(LinkList &L, int a, int b)
{
LNode *pre, *p;
pre = L;
p = L->next;
while (p != NULL)
{
if (p->data > a && p->data < b)
{
pre->next = p->next;
free(p);
p = pre->next;
}
else
{
p = p->next;
pre = pre->next;
}
}
}
int main(void)
{
LNode *L;
InitList(L);
printf("shuruzifu:");
List_TailInsert(L);
printlist(L);
printf("\n________\n");
DeleteElem(L, 1, 4);
printlist(L);
return 0;
}