使用动态数组解决数组遍历比较并插入

题目

从线性表Lb中依次取得每个数据元素，并依值在线性表La中进行查访，
若不存在则插入之
示例输入：La = {2, 4, 7, 8, 10, 12}; 
		 Lb = {3, 7, 13};
示例输出: La = {2, 4, 7, 8, 10, 12, 3, 13};

代码

/**
 * @author: Simon_z
	从线性表Lb中依次取得每个数据元素，并依值在线性表La中进行查访，若不存在则插入之
	示例输入：La = {2, 4, 7, 8, 10, 12};
			  Lb = {3, 7, 13};
	示例输出: La = {2, 4, 7, 8, 10, 12, 3, 13};
 */
//	使用动态数组分配La，Lb内存，需输入La, Lb的length

#include <stdio.h>
#include <iostream>
#include <stdlib.h>
using namespace std;

int *CreateDynamicArray(int *p, int arrayLength);
int Compare(int array[], int value, int length);

int main(int argv,char *argc[]){
    int *La, *Lb;
    int La_Length, Lb_Length;
    bool Perform;
    //构造数组La，Lb
    printf("Please input La_Length: ");
    scanf("%d", &La_Length);
    printf("Please input La_array: ");
    La = CreateDynamicArray(La, La_Length);
    printf("Please input Lb_Length: ");
    scanf("%d", &Lb_Length);
    printf("Please input Lb_array: ");
    Lb = CreateDynamicArray(Lb, Lb_Length);
    //输出插入前的La，Lb
    printf("Brfore Insert: \n");
    printf("La: ");
    for (int i = 0; i < La_Length; i++){
    	printf("%d ", La[i]);
    }
    printf("\n");
    printf("Lb: ");
    for (int i = 0; i < Lb_Length; i++){
    	printf("%d ", Lb[i]);
    }
    //执行将Lb在La中没有的元素插入到La中
    printf("\n");
    printf("After Insert: \n");
    /**
     * 实现数组的动态增长
     * 1.对表进行检查，看看它是否真的已满(我懒得检查，反正肯定是满的).
     * 2.如果表确实已满,使用realloc()函数扩展表的长度.
     * 3.在表中增加所需要的项目.
     */
    int location = 0; //执行添加后Lb遍历初始位置
    for (int i = location; i < Lb_Length; i++){
    	Perform = Compare(La, Lb[i], La_Length); // 得到La是否需要增加内存
    	if (Perform == true){
    		La_Length += 1; // La内存长度+1
    		La = (int *)realloc(La, La_Length*sizeof(int)); //给修改长度的La重新分配内存
    		La[La_Length - 1] = Lb[i];
    		location += 1; //遍历起始位置+1
    	}else{
    		continue;
    	}
    }
    //输出插入后的La
    printf("La: ");
    for (int i = 0; i < La_Length; i++){
    	printf("%d ", La[i]);
    }

    free(La);//释放内存
    free(Lb);//释放内存
    return 0;
}

//返回头指针即可
int *CreateDynamicArray(int *p, int arrayLength){
    int c;
    p = (int *)malloc(arrayLength*sizeof(int));	//在堆中开辟数组内存
    for(int i = 0;i < arrayLength; i++)
    {
        scanf("%d", &c);
        p[i] = c;
    }
    return p;
}

//遍历La数组判断是否需要插入元素，返回true/false
int Compare(int array[], int value, int length){
	bool Judge = true;
	for (int i = 0; i < length; i++){
		if (array[i] == value){
			Judge = false;
			break;
		}
	}
	return Judge;
}