动态数组

动态数组

用动态数组实现：增加数组长度、删除元素、合并2个有序数组

#include <stdio.h>
#include <stdlib.h>

#define TRUE 1
#define FALSE 0
#define OVERFLOW -2
#define ERROR 0
#define OK 1
#define MAX_QSIZE 5
#define INCREMENT 2


typedef int elementType;

typedef struct array
{
	elementType * base;
	int len;
} Array, *arrayPtr;


void initArray(arrayPtr aPtr, int n = MAX_QSIZE)
{
	aPtr->base = (elementType *)malloc(sizeof(elementType) * (n));

	if(!aPtr)
	{
		exit(OVERFLOW);
	}

	aPtr->len = n;

}

bool increaseArraySize(arrayPtr aPtr, int m = INCREMENT, bool isAdd=0)
{
	if(isAdd)
	{
		aPtr->base = (elementType *)realloc(aPtr->base, sizeof(elementType)*(aPtr->len + m));
	}
	else
	{
		aPtr->base = (elementType *)realloc(aPtr->base, sizeof(elementType)*(aPtr->len) * m);
	}

	if(!aPtr->base)
	{
		return ERROR;
	}

	if(isAdd)
	{
		aPtr->len = aPtr->len + m;
	}
	else
	{
		aPtr->len = aPtr->len * m;
	}

	
	return OK;
}

bool incArrayElement(arrayPtr aPtr, elementType val)
{
	bool bl = increaseArraySize(aPtr, 1, 1);
	int locate = aPtr->len;
	if(bl)
	{
		for(int i=aPtr->len-1; aPtr->base[i-1]>=val; i--)
		{
			aPtr->base[i] = aPtr->base[i-1];
			locate = i;
		}
		printf("locate = %d\n", locate);

		aPtr->base[locate-1] = val;
		return OK;
	}
	else
	{
		return ERROR;
	}
}


void deleteElement(arrayPtr aPtr, elementType val)
{
	int i = 0;
	while((aPtr->base[i] != val) && (i<aPtr->len-1))
	{
		i++;
	}


	if(aPtr->base[aPtr->len-1] == val)
	{
		aPtr->base = (elementType *)realloc(aPtr->base, sizeof(elementType)*(aPtr->len - 1));
		aPtr->len = aPtr->len - 1;
		return ;
	}

	while(i<aPtr->len-1)
	{
		aPtr->base[i] = aPtr->base[i+1];
		i++;
	}
	aPtr->base = (elementType *)realloc(aPtr->base, sizeof(elementType)*(aPtr->len - 1));
	aPtr->len = aPtr->len - 1;


}

void printArray(Array a)
{
	for(int i=0; i<a.len; i++)
	{
		printf("%d, ",a.base[i]); 
	}
	printf("\n");
}

Array mergeArray(Array a1, Array a2)
{
	Array a;
	initArray(&a, (a1.len + a2.len));

	int i=0, j=0, k=0;

	// printf("############################\n");

	while(i < a1.len || j < a2.len)
	{
		if(a1.base[i] < a2.base[j] && i < a1.len)
		{
			a.base[k] = a1.base[i];
			i++;
			k++;
		}
		else if(a1.base[i] > a2.base[j] && j < a2.len)
		{
			a.base[k] = a2.base[j];
			j++;
			k++;
		}
		else
		{
			a.base[k] = a1.base[i];
			i++;
			j++;
			k++;
		}
		printf("k = %d\n", k);
	}

	a.base = (elementType *)realloc(a.base, sizeof(elementType) * (k - 1));
	a.len = k - 1;

	return a;
}

int main(int argc, char const *argv[])
{
	
	Array a, a1, a2, m;
	bool bl;
	int len1;

	initArray(&a, 10);
	printf("len = %d\n", a.len);

	for(int i=0; i<a.len; i++)
	{
		a.base[i] = i * 2;
	}

	printArray(a);

	len1 = a.len;
	bl = increaseArraySize(&a, 5, 1);
	if(bl)
	{
		for(int i=len1; i<a.len; i++)
		{
			a.base[i] = i * 2;
		}
	}

	printArray(a);

	bl = incArrayElement(&a, 77);
	printArray(a);

	deleteElement(&a, 0);
	printArray(a);


	initArray(&a1, 10);
	printf("len = %d\n", a1.len);

	for(int i=0; i<a1.len; i++)
	{
		a1.base[i] = i * 2;
	}
	printArray(a1);

	initArray(&a2, 10);
	printf("len = %d\n", a2.len);

	for(int i=0; i<a2.len; i++)
	{
		a2.base[i] = i * 2 + 1;
	}
	printArray(a2);

	m = mergeArray(a1, a1);
	printArray(m);


	printf("successsul!!!\n");
	
	return 0;
}