myList.cpp

#include<iostream>
using namespace std;

template<class T>
class myList;//前置声明

template<class T>
class myListNode {
private:
	T val;
	myListNode* next;
public:
	friend class myList<T>;
	myListNode() :val(), next(nullptr) {}
	myListNode(T x) :val(x), next(nullptr) {}
	friend ostream& operator<< <T>(ostream&,const myList<T>&);
};

template<class T>
class myList {
private:
	myListNode<T>* head;
public:
	myList():head(nullptr) {}
	myList(const T* inputs, int size) {
		head = new myListNode<T>(inputs[0]);
		myListNode<T>* ptr = head;
		for (int i = 1; i < size; ++i) {
			ptr->next = new myListNode<T>(inputs[i]);
			ptr = ptr->next;
		}
	}
	~myList() {   
		myListNode<T>* now = head;
		myListNode<T>* far = now->next;
		while (far != nullptr) {
			delete now;
			now = far;
			far = far->next;
		}
		delete now;
	}
	myList(const myList& input) {
		head = new myListNode<T>(input.head->val);
		myListNode<T>* ptr2 = input.head->next;
		myListNode<T>* ptr1 = head;
		while (ptr2 != nullptr) {
			ptr1->next = new myListNode<T>(ptr2->val);
			ptr2 = ptr2->next;
			ptr1 = ptr1->next;
		}
	}

	//=赋值
	myList& operator=(const myList& input) {
		head = new myListNode<T>(input.head->val);
		myListNode<T>* ptr2 = input.head->next;
		myListNode<T>* ptr1 = head;
		while (ptr2 != nullptr) {
			ptr1->next = new myListNode<T>(ptr2->val);
			ptr2 = ptr2->next;
			ptr1 = ptr1->next;
		}
		return *this;
	}

	//[]获取链表内容
	T operator[](int input) {
		myListNode<T>* ptr = head;
		for (int i = 0; i < input; ++i) {
			ptr = ptr->next;
		}
		return ptr->val;
	}

	//在末尾添加元素
	myList& add(T input) {
		if (!head) {
			head = new myListNode<T>(input);
			return *this;
		}
		myListNode<T>* ptr = head;
		while (ptr->next != nullptr) {
			ptr = ptr->next;
		}
		ptr->next = new myListNode<T>(input);
		return *this;
	}

	//末尾删除元素
	myList& pop() {
		if (!head) {
			throw out_of_range("列表为空，无法删除");
		}
		if (!(head->next)) {
			delete head;
			head = nullptr;
			return *this;
		}
		myListNode<T>* ptr = head;
		while (ptr->next->next != nullptr) {
			ptr = ptr->next;
		}
		delete ptr->next;
		ptr->next = nullptr;
		return *this;
	}

	//cout输出
	friend ostream& operator<< <T>(ostream& , const myList& );
};

template<class T>
ostream& operator<<(ostream& out, const myList<T>& input) {
	out << "{ " << input.head->val;
	myListNode<T>* ptr = input.head->next;
	while (ptr != nullptr) {
		out << "," << ptr->val;
		ptr = ptr->next;
	}
	out << " }";
	return out;
}


//以下为调试代码


myList<int> test() {
	myList<int>test;
	test.add(3).add(5).add(8);
	return test;
}


int main() {

	myList<int>test1;
	test1= test();
	return 0;
}