动态生成结构体数组并释放空间

动态生成一个结构体数组

struct TreeNode {
	int index;
	int* len;
	const char* name;
};

void print(TreeNode* node) {
	std::cout << "Node index: " << node->index 
		      << ", length: " << *node->len 
			  << ", name: " << node->name << std::endl;
}

TreeNode** Generate() {
	TreeNode** nodeLists = (TreeNode**)malloc(sizeof(TreeNode*) * 2);

	nodeLists[0] = (TreeNode*)malloc(sizeof(TreeNode));
	std::cout << nodeLists[0] << std::endl;
	nodeLists[0]->index= 0;
	nodeLists[0]->len = (int*)malloc(sizeof(int));
	*(nodeLists[0]->len) = 4;
	nodeLists[0]->name = "Bin";
	

	nodeLists[1] = (TreeNode*)malloc(sizeof(TreeNode));
	nodeLists[1]->index = 1;
	nodeLists[1]->len = (int*)malloc(sizeof(int));
	*(nodeLists[1]->len) = 5;
	nodeLists[1]->name = "Star";
}

void FreeNode(TreeNode** nodeLists) {
	free(nodeLists[0]->len); nodeLists[0]->len = NULL;
	free(nodeLists[0]);		 nodeLists[0] = NULL;
	free(nodeLists[1]->len); nodeLists[1]->len = NULL;
	free(nodeLists[1]);		 nodeLists[1] = NULL;
	free(nodeLists);		 nodeLists = NULL;
}

int main() {
	TreeNode** nodeLists = Generate();
	print(nodeLists[0]);
	print(nodeLists[1]);
	FreeNode(nodeLists);
	return 0;
}
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值