//合并操作
void MergeList(const SqList * A,const SqList * B,SqList * C) {
int i=0,j=0;
while(i<A->length && j<B->length) {
if(*GetElem(A, i) <= *GetElem(B, i)) {
insert(C,GetElem(A, i));
insert(C,GetElem(B, i));
} else {
insert(C,GetElem(B, i));
insert(C,GetElem(A, i));
}
i++,j++;
}
while(i<A->length) {
insert(C,*GetElem(A,i));
i++;
}
while(j<B->length) {
insert(C,*GetElem(B,j));
j++;
}
}
//并集操作
void list_union(SqList * A,SqList * B,SqList * C) {
int i=0,j=0,n=0;
while(i<A->length && j<B->length) {
if(*GetElem(A, i) < *GetElem(B,j)) {
insert(C,*GetElem(A, i));
insert(C,*GetElem(B,j));
n+=2;
} else if(*GetElem(A, i) == *GetElem(B,j)) {
insert(C,*GetElem(A, i));
n++;
} else {
insert(C,*GetElem(B,j));
insert(C,*GetElem(A, i));
n+=2;
}
i++,j++;
}
while(i<A->length) {
if(*GetElem(C,n-1) == *GetElem(A,i)) {
i++;
continue;
}
insert(C,*GetElem(A,i));
n++;
i++;
}
while(j<B->length) {
if(*GetElem(C,n-1) == *GetElem(B,j)) {
j++;
continue;
}
insert(C,*GetElem(B,j));
n++;
j++;
}
}
//交集操作
void diffence(SqList A, SqList B,SqList &C) {
int i = 0, j = 0, k = 0;
while (i < A.length&&j < B.length) {
if (A.data[i] < B.data[j]) {
C.data[k] = A.data[i];
i++;
k++;
} else if (A.data[i]>B.data[j]) j++;
else {
j++;
k++;
}
}
while (i < A.length) {
C.data[k] = A.data[i];
i++;
k++;
}
C.length = k;
}
顺序线性表的合并、并集、交集
最新推荐文章于 2021-12-11 21:21:43 发布