《数据结构》-基础动态数据初始化及添加元素

#include <stdio.h>
#include <malloc.h>
struct DongShuZu
{
	 int * pshuzutou;//数组首地址
	 unsigned int iRongLiang;//数组容量
	 unsigned int iShuLiang;//已存储的数量
};

void ChuShiHua(struct DongShuZu* pstshuzu)
{
	if (NULL == pstshuzu)
	{
		printf("参数错误\n ");
		return;

	}
	pstshuzu->iRongLiang=5;
	pstshuzu->pshuzutou=(int*)malloc(sizeof(int)*pstshuzu->iRongLiang);
	pstshuzu->iShuLiang=0;
}
 void zeng(struct DongShuZu * pstshuzu,int ishuju)
 {
	 if (NULL == pstshuzu)
	 {
		 printf("参数错误\n ");
		 return;

	 }
	 if(pstshuzu->iRongLiang==pstshuzu->iShuLiang)//判断数组是否满了
	 {
			//满了申请新的容量
		 pstshuzu->iRongLiang+=10;
            int *ptemp= (int*)malloc(sizeof(int) * pstshuzu->iRongLiang);
			//复制原数据进新空间
			for (unsigned int i = 0; i < pstshuzu->iShuLiang; i++)
			{
				ptemp[i] = pstshuzu->pshuzutou[i];
			}
			//释放原空间
			free(pstshuzu->pshuzutou);
			//将数组头指向新空间
			pstshuzu->pshuzutou = ptemp;
	 }

	 //装数据
	 pstshuzu->pshuzutou[pstshuzu->iShuLiang] = ishuju;
	 pstshuzu->iShuLiang++;
 }
 void shuchu(struct DongShuZu *stshuzu)
 {
	 if (NULL == stshuzu)
	 {
		 printf("参数错误\n ");
		 return;

	 }
	 printf("数组容量现有%u\n ", stshuzu->iRongLiang);
	 printf("数组现存数量有%u\n ", stshuzu->iShuLiang);
	 for (int i = 0; i < stshuzu->iShuLiang; i++)
		 printf("数组第%d的值为%d \n", i+1,stshuzu->pshuzutou[i]);

 }
int main(void)
 {
	 struct DongShuZu stshuzu;
	 ChuShiHua(&stshuzu);
	 for (int i = 0; i < 10; i++)
		 zeng(&stshuzu, i);

	 shuchu(&stshuzu);
	 return 0;
	 free(stshuzu.pshuzutou);
 }