单向链表实现C++

1.创建链表节点结构体ListNode

class List
{
public:

	/// <summary>
	/// @链表节点结构体
	/// </summary>
	typedef struct ListNode
	{
		int Value;
		ListNode* Next;
	}ListNode;

	static void PrintList();
};

2.主要实现 

/// <summary>
/// 打印0到10的单向链表
/// </summary>
void List::PrintList()
{
	//创建头指针
	List::ListNode* HeadNode = new List::ListNode;
	//头指针初始化
	HeadNode->Value = 0;
	HeadNode->Next = 0;

	//创建辅助指针并赋值为头指针
	List::ListNode* ptr = HeadNode;

	for (int i = 0; i < 10; i++)
	{
		//动态创建新的链表节点
		List::ListNode* NewNode = new List::ListNode;
		NewNode->Value = i;
		NewNode->Next = 0;

		//辅助指针把最新节点链接到末尾
		ptr->Next = NewNode;
		//辅助指针后移指向最新节点
		ptr = NewNode;
	}

	ptr = HeadNode;
    //打印
	while (ptr->Next != 0)
	{
		//先把辅助指针指向头结点在输出节点的值
		ptr = ptr->Next;
		std::cout << ptr->Value << " ";
	}

	delete HeadNode;
}