模板小练习

使用模板创建和删除单向链表

struct ListNode {
	int val;
	ListNode* next;
	ListNode(const int& _val = int(), ListNode* _next = nullptr)
		: val(_val), next(_next) {}
};

template<typename ...Args>
ListNode* CreateList(const int& val, Args&&... args) {
	return new ListNode(val, CreateList(std::forward<Args>(args)...));
}

template<>
ListNode* CreateList(const int& val) {
	return new ListNode(val);
}

void ClearList(ListNode** node) {
	ListNode** cur = node;
	while (*cur) {
		ListNode* entry = *cur;
		*cur = entry->next;
		delete entry;
		entry = nullptr;
	}
}

使用示例

ListNode * a = MakeList(1, 2, 3, 4, 5);
/* do something */
ClearList(&a);

使用模板创建和删除多维数组

template<typename T>
void allocate(T*& ptr, int n) {
	ptr = new T[n];
}

template<typename T, typename ...Args>
void allocate(T*& ptr, int n, Args&&... args) {
	ptr = new T[n];
	for (int i = 0; i < n; ++i) {
		allocate(ptr[i], args...);
	}
}

template<typename T>
void deallocate(T*& ptr, int n) {
	delete[] ptr;
	ptr = nullptr;
}

template<typename T, typename ...Args>
void deallocate(T*& ptr, int n, Args&&... args) {
	for (int i = 0; i < n; ++i) {
		deallocate(ptr[i], args...);
	}
	delete[] ptr;
	ptr = nullptr;
}

使用示例

int*** ptr = nullptr;
int n = 1, m = 2, p = 3;
allocate(ptr, n, m, p);
/* do something */
deallocate(ptr, n, m, p);