C++实现链表

c++实现链表

前面已经用c语言实现了传统链表和企业链表，其实不管是用c++还是c语言，实现链表的核心思路都是一样的，根本的区别在于语法上，以及在一些变量的生命周期管理上稍有差异；

//c++LinkList.h
#pragma once
#include<iostream>
using namespace std;
template <typename T>
 struct Node
{
	T t;//缓存t元素  
	struct Node<T>* next;
};
template <typename T>
class LinkList
{
public:
	LinkList();
	~LinkList();
public:
	int insert(T &t, int pos);//类的api函数由于隐藏了this指针，所以少了一个链表头结点的参数
	int get(int pos, T& t);
	int clear();
	int del(int pos, T& t);
	int getLen();
 
protected:
	Node<T>* m_header;
	int m_len;
private:
};
template <typename T>
LinkList<T>::LinkList()
{
	m_header = new Node<T>;
	m_header->next = NULL;
	m_len = 0;
}
template <typename T>
LinkList<T>::~LinkList()
{
	Node<T>* tmp = NULL;
	while (m_header)
	{
		tmp = m_header->next;
		delete m_header;
		m_header = tmp;
	}
}
template <typename T>
int LinkList<T>::insert(T &t, int pos)//类的api函数由于隐藏了this指针，所以少了一个链表头结点的参数
{
	Node<T>* current = NULL;//node结点类型 辅助指针变量
	current = m_header;
	for (int i = 0; i < pos; i++)
	{
		current = current->next;
	}
	//把上层应用的t结点，缓存到容器中
	Node<T>* node = new Node<T>;
	node->next = NULL;
	node->t = t;
	//把node结点在pos位置加入到链表中
	node->next = current->next;
	current->next = node;
	m_len++;
	return 0;
}
template <typename T>
int LinkList<T>::get(int pos, T &t)
{
	Node<T>* current = NULL;
	current = m_header;
	for (int i = 0; i < pos; i++)
	{
		current = current->next;
	}
	t = current->next->t;
	return 0;
}
template <typename T>
int LinkList<T>::clear()
{
	//把旧的结点删掉
	Node<T>* tmp = NULL;
	while (m_header)
	{
		tmp = m_header->next;
		delete m_header;
		m_header = tmp;
	}
	//重新创建链表
	m_header = new Node<T>;
	m_len = 0;
}
template <typename T>
int LinkList<T>::del(int pos, T &t)
{
	Node<T>* current = NULL;
	Node<T>* ret = NULL;
	current = m_header;
	for (int i = 0; i < pos; i++)
	{
		current = current->next;
	}
	ret = current->next;  
	t = current->next->t;
	current->next = ret->next;
	m_len--;
	delete ret;//注意释放内存，因为insert的时候，new了一个结点
	return 0;
}
template <typename T>
int LinkList<T>::getLen()
{
	return m_len;
}
//链表类测试框架.cpp
#include<iostream>
using namespace std;
#include"c++LinkList.h"
struct teacher
{
	char name[32];
	int age;
};
void main01()
{
	teacher t1, t2, t3;
	teacher tmp;
	t1.age = 31;
	t2.age = 32;
	t3.age = 33;
	LinkList<teacher> list;
	//插入元素
	list.insert(t1, 0);
	list.insert(t2, 0);
	list.insert(t3, 0);
	//遍历链表
	for (int i = 0; i < list.getLen(); i++)
	{
		list.get(i,tmp);
		cout << tmp.age << endl;
	}
	// 销毁链表
	while (list.getLen() > 0)
	{
		list.del(0, tmp);
		cout << tmp.age << endl;
	}
	cout << "hello world" << endl;
}

int main()
{
	main01();
	return 0;
}