线性表的顺序存储与合并操作

void CombineLinearLists(SqList &La, SqList &Lb) {
int i, j;
for (i = 0; i int count = 0;
for (j = 0; j if (La.elem[j] == Lb.elem[i]) count++;
}
if (count == 0) La.elem[La.length++] = Lb.elem[i];
}
}

// 有序线性表的合并，前提是两个线性表已按非递减顺序排序
void MergeSortedLists(SqList &LA, SqList &LB, SqList &LC) {
// LA和LB是按非递减顺序排序的
LC.length = LA.length + LB.length;
LC.elem = new ElemType[LC.length];
// 分配空间
ElemType *pa = LA.elem, *pb = LB.elem, *pc = LC.elem;
ElemType *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++;
while (pb <= pb_last) *pc++ = *pb++;
}