9.19 周二总结

上午学了数据结构，学会了线性表以及有序表的合并问题

以下是pta两个有序表合并问题的代码。

除此之外，还讲了栈的定义和特点，先进后出，

学会了1，2，3按顺序进入栈，退栈次序一共有五种。
#include "stdio.h"
#include "malloc.h"
struct MyStruct
{
int data;
struct MyStruct* next;
};
typedef struct MyStruct* List;
List GetList();
List MergeList(List LA,List LB);
void PrintList(List LC);
int main() {
List LA, LB, LC;
LA = GetList();
//PrintList(LA);
LB = GetList();
//PrintList(LB);
LC = MergeList(LA,LB);
PrintList(LC);
return 0;
}
List GetList() {
List p=NULL, head=(List)malloc(sizeof(struct MyStruct));
head->data = 0;
head->next = NULL;
int k;
scanf("%d", &k);
while (k != -1) {
List s = (List)malloc(sizeof(struct MyStruct));
s->data = k;
s->next = NULL;
if (p == NULL) {
p = s;
head->next = p;
}
else {
p->next = s;
p = s;
}
scanf("%d", &k);
}
return head;
}
List MergeList(List LA, List LB) {
List LC, pa, pb,pc;
pa = LA->next;
pb = LB->next;
LC = LA;
LC ->next = NULL;
pc = LC;
while (pa!=NULL && pb!=NULL) {
if (pa->data < pb->data) {
pc->next = pa;
pc = pa;
pa = pa->next;
}
else {
pc->next = pb;
pc = pb;
pb = pb->next;
}
}
if (pa)
pc->next = pa;
else
pc->next = pb;
free(LB);
return LC;
}
void PrintList(List LC) {
int i = 0;
LC = LC->next;
if (LC == NULL) {
printf("NULL");

}
while (LC) {
if (i != 0) {
printf(" ");
}
printf("%d", LC->data);
i++;
LC = LC->next;
}
}