顺序表的合并

朱雀 2022-08-19 02:10 137阅读 0赞

<span style="font-family: Arial, Helvetica, sans-serif;"></pre><pre name="code" class="cpp">#include<stdio.h></span>

#include<stdlib.h> 
    #define MAXSIZE 20
    #define OK 1
    #define ERROR 0
    #define TRUE 1
    #define FALSE 0
    typedef int Status;
    typedef int ElemType;
    struct SqList{
    	ElemType *elem;
    	int length;	
    	int maxsize;
    };
    
    Status InitList(SqList &L){
    	L.elem = (ElemType *)malloc(sizeof(ElemType) * 20);
    	if(!L.elem){
    		exit(1);
    	}
    	L.length = 0;
    	L.maxsize = 20;
    	return OK;
    }
    Status CreatList(SqList &L, int n){
    	if(n >= (L.maxsize - L.length)){
    		L.elem = (ElemType *) realloc(L.elem, sizeof(ElemType) * n);
    		if(!L.elem){
    			exit(1);
    		}
    		L.maxsize = L.maxsize + n;
    	}
    	
    	for(int i = 0; i<n; i++){
    		printf("请输入第%d个:\n", i+1);
    		scanf("%d", &L.elem[i]);
    		L.length = n;
    	}
    	
    }
    void printList(SqList &L){
    	printf("所有元素输出为：\n");
    	for(int i = 0; i < L.length; i++){
    		printf("%d ", L.elem[i]); 
    	}
    	printf("\n");
    }
    
    void mergeList(SqList &La, SqList &Lb){
    	int la_len, i, j, k;
    	la_len = La.length - 1;
    	k = La.length;
    	for(i = 0; i<Lb.length; i++){
    		for(j = 0; Lb.elem[i] > La.elem[j] && j < la_len; j++);
    		if(Lb.elem[i] < La.elem[j]){
    			if(La.length >= La.maxsize){
    				La.elem = (ElemType *) realloc(La.elem, sizeof(ElemType) * MAXSIZE);
    				if(!La.elem){
    					exit(1);					
    				}
    				La.maxsize = La.maxsize + MAXSIZE;
    			}
    			La.elem[k] = Lb.elem[i];
    			La.length++;
    			k++;
    		}
    		
    	}
    }
    int main(){
    	struct SqList La;
    	struct SqList Lb;
    	int n;
    	InitList(La);
    	InitList(Lb);
    	printf("请输入La元素的个数："); 
    	scanf("%d", &n);
    	CreatList(La, n);
    	printList(La);
    	printf("请输入Lb元素的个数："); 
    	scanf("%d", &n);
    	CreatList(Lb, n);
    	printList(Lb);
    	mergeList(La, Lb);
    	printList(La);
    	return 0;
    }