2.9.3线性表的应用

线性表的合并

void union(List& La, List Lb) {
	La_len = ListLength(La);
	Lb_len = ListLength(Lb);
	for (i = 1; i < Lb_len; i++) {
		GetElem(Lb, i, e);
		if (!LocateElem(La, e))ListInsert(&La, ++La_len, e);
	}
}

顺序表实现

void MergeList_Sq(SqList LA, SqList LB, SqList& LC) {
	pa = LA.elem;
	pb = LB.elem;//指针pa,pb指向的是第一个元素
	LC.length = LA.length + LB.length;//新表长度为待合并两表长度之和
	LC.elem = new ElemType[LC.length];//为合并后的新表分配一个数组空间
	pc = LC.elem;//指向新表的第一个元素
	pa_last = LA.elem + LA.length - 1;//最后一个元素
	pb_last = LB.elem + LB.length - 1;
	while (pa <= pa last && pb <= pb last) {//两表都非空
		if (*pa <= *pb)*pc++ = *pa++;//依次摘取两表中值较小的结点
		else *pc++ = *pb++;
	}
	while (pa <= pa_last)*pc++ = *pa++;//LB达到表尾，将LA中剩余加入LC
	while (pb <= pb_last)*pc++ = *pb++;
}//MergeList_Sq

 链表实现

 

 PS：三目运算符

 ​​​​​​

 

void MergeList_L(LinkList& La, LinkList& Lb, LinkList& Lc) {
	pa = La->next; pb = Lb->next;
	pc = Lc = La;//用La的头结点作为Lc的头结点
	while (pa && pb) {
		if (pa->data <= pb->data) {
			pc->next = pa; pc = pa; pa = pa->next;
		}
		else {
			pc->next = pb; pc = pb; pb = pb->next;
		}
	}
	pc->next = pa ? pa : pb;//插入剩余段
	delete Lb;
}