C++ 链表操作

代码实现

#include <iostream>
using namespace std;
struct node
{
	int data;
	struct node *next;
};
class LinkList
{
private:
	struct node *head;
public:
	LinkList(){head = NULL;}
	~LinkList();
	bool Insert(int e);
	void linkprint()
	{
		cout << head -> data << endl;
		head = head -> next;
	}
};

LinkList::~LinkList()
{

}
bool LinkList::Insert(int e)
{
	struct node *p = head,*s;
	int j = 0;
	if(head == NULL)
	{
		s = (struct node *)new struct node[1];
		s -> data = e;
		//s -> next = p;
		head = s;
		struct node *p1 = head;
		
		//head -> data = e;
		return true;
	}
	s = (struct node *)new struct node[1];
	s -> data = e;
	s -> next = head -> next;
	head -> next = s;
	return true;
}
int main()
{
	LinkList li;
	li.Insert(1);
	li.Insert(2);
	li.linkprint();
	li.linkprint();
	system("pause");
	return 0;
}