链表

最新推荐文章于 2020-09-19 23:09:52 发布

不死鸟-PHOENIX

最新推荐文章于 2020-09-19 23:09:52 发布

阅读量213

点赞数

CC 4.0 BY-SA版权

分类专栏： c++ 文章标签：链表

本文链接：https://blog.youkuaiyun.com/WeiJun_power/article/details/77197940

c++ 专栏收录该内容

64 篇文章

订阅专栏

本文介绍了一个简单的单链表类的实现，包括插入、删除、查找等基本操作，并通过一个示例展示了如何使用该类进行数据管理。文章涵盖了单链表的基本概念、节点结构定义、成员函数的功能说明及其实现细节。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <iostream>
using namespace std;

typedef int T;

class List{
	struct Node{
		T data;
		Node* next;
		Node(const T& t=T()):data(t)
		{
			next = NULL;
		}
	};
	Node* head;
public:
	List():head(NULL)
	{
		
	}
	void clear()
	{
		while(head != NULL)
		{
			Node* q = head->next;
			delete head;
			head = q;
		}
	}
	~List()
	{
		clear();
	}
	void insert_front(const T& t)
	{
		Node* p = new Node(t);
		p->next= head;
		head = p;
	}
	
	void insert_back(const T& t)
	{
		Node* p = new Node(t);
		if (head==NULL)
			head = p;
		else
		{
			get_pointer(size()-1)->next = p;
		}
	}
	
	void travel()
	{
		Node* p=head;
		while(p != NULL)
		{
			cout << p->data << ' ';
			p = p->next; 
		}
		cout << endl;
	}
	int size()
	{
		int cnt = 0;
		Node* p = head;
		while(p != NULL)
		{
			cnt++;
			p = p->next;
		}
		return cnt;
	}
	
	T get_head()
	{
		if (head == NULL)
		{
			throw "no head";
		}	
		return head->data;
	}
	T get_tail()
	{
		if (head == NULL)
			throw "no tail";
		Node* p = head;
		while(p->next != NULL)
		{
			p = p->next;
		}
		return p->data;
	}
	
	bool empty()
	{
		return head == NULL;
	}
	
	int find(const T& t)
	{
		int pos = 0;
		Node* p = head;
		while(p != NULL)
		{
			if (p->data== t)
				return pos;
			p = p->next;
			pos++;
		}
		return -1;
	}
	bool update(const T& o, const T& n)
	{
		int pos = find(o);
		if (pos == -1)
			return false;
		Node* p = get_pointer(pos);
		p->data = n;
		
		return true;
	}
private:
	Node* get_pointer(int pos)
	{
		Node* p = head;
		for (int i=0; i<pos; i++)
			p = p->next;
		
		return p;
	}
public:
	bool erase(const T& t)
	{
		int pos = find(t);
		if (pos == -1)
			return false;
		if (pos ==0)
		{
			Node* q = head->next;
			delete head;
			head = q;
		}
		else
		{
			Node* pre = get_pointer(pos-1);
			Node *cur = pre->next;
			pre->next= cur->next;
			delete cur;
		}
	}	
};

int main()
{
	List obj;
	obj.insert_front(1);
	obj.insert_front(2);
	obj.insert_front(3);
	obj.insert_front(4);
	obj.insert_front(5);
	obj.insert_back(88);
	cout << "size:" << obj.size() << endl;
	obj.travel();
	cout << "find 3:" << obj.find(3) << endl;
	cout << "find 3:" << obj.find(8) << endl;
	obj.update(4, 100);
	obj.travel();
	obj.erase(3);
	obj.erase(5);
	obj.erase(1);
	obj.travel();
	
	return 0;
}