心动C++情牵链表

最新推荐文章于 2024-10-17 23:56:42 发布

原创最新推荐文章于 2024-10-17 23:56:42 发布 · 687 阅读

0 ·

CC 4.0 BY-SA版权

[ DataStruct And Algorithms ] 专栏收录该内容

21 篇文章

订阅专栏

本文介绍了一个简单的循环链表的数据结构实现，包括插入、删除等基本操作，并提供了完整的源代码示例。通过一个测试程序展示了如何使用该链表。

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

/*--------------------------------------------------------------------------------
 * Project: TList.h
 * Name: zwp
 * Date: 2013.4
 *--------------------------------------------------------------------------------*/


#ifndef TLIST_H_
#define TLIST_H_

#include <iostream>

typedef int ListType; // 元素类型

class List
{// 循环链表
private:
	struct Node
	{
		ListType data;
		Node* next;

		Node(ListType value, Node* link = 0)
		{
			data = value;
			next = link;
		}
	};
	typedef Node* NodePointer;
	NodePointer head;

public:
	List();

	~List();

	List(const List& list);

	const List& operator=(const List& list);

	bool empty(void)const;

	void insert(ListType value);

	void deleted(void);

	friend std::ostream& operator<<(std::ostream& os, const List& list);

};


#endif

/*------------------------------------------------------------------------
 * Project: TList.cpp
 * Name: zwp
 * Date: 2013.4
 *-------------------------------------------------------------------------*/

#include <cassert>
#include "TList.h"


List::List()
	:head(0)
{ }

List::~List()
{
	if(!empty())
	{
		List::NodePointer ptr = head;
		List::NodePointer prev;

		while(ptr != 0)
		{
			prev = ptr->next;
			delete ptr;
			ptr = prev;
		}
	}	
}

bool List::empty(void)const
{
	return (head == 0);
}

List::List(const List& list)
{
	if(!empty())
	{
		head = new List::Node(list.head->data);

		List::NodePointer ptr = list.head->next;
		List::NodePointer prev = head;

		while(ptr != 0)
		{
			prev->next = new List::Node(ptr->data);
			ptr = ptr->next;
			prev = prev->next;
		}
	}
}

const List& List::operator=(const List& list)
{
	if(this != &list)
	{
		this->~List(); // 销毁之前的链表
		if(list.empty())
			head = 0;
		else
		{
			head = new List::Node(list.head->data);
			List::NodePointer ptr = list.head->next;
			List::NodePointer prev = head;

			while(ptr != 0)
			{
				prev->next = new List::Node(ptr->data);
				prev = prev->next;
				ptr = ptr->next;
			}
			
		}
	}
	return *this;
}


void List::insert(ListType value)
{
	List::NodePointer prev = head;
	List::NodePointer ptr;
	ptr = new List::Node(value);

	assert(ptr != 0);

	if(head == 0)
		head = ptr;
	else
	{
		while(prev->next != 0)
			prev = prev->next; // 找到链表末尾
		prev->next = ptr; // 将新的节点插入
	}
}

void List::deleted(void)
{
	if(empty())
		std::cerr <<"The List is empty..."<<std::endl;
	else
	{
		List::NodePointer ptr = head;
		head = head->next;
		delete ptr;
	}
}

std::ostream& operator<<(std::ostream& os, const List& list)
{
	//assert(!list.empty());

	List::NodePointer ptr = list.head->next;
	while(ptr != 0)
	{
		std::cout <<ptr->data<<"  ";
		ptr = ptr->next;
	}
	return os;
}

/*-------------------------------------------------------------------------------
 * Project: Test.cpp
 * Name: zwp
 * Date: 2013.4
 *-------------------------------------------------------------------------------*/


#include <iostream>
#include "TList.h"


int main(void)
{
	List list1;

	for(int index = 1; index < 10; index ++)
		list1.insert(index);
	
	list1.deleted();

	List list2(list1);
	std::cout <<list2<<std::endl;
	List list3 = list2;
	std::cout <<list3<<std::endl;
	std::cout <<list1<<std::endl;

	system("pause");
	return 0;
}