【数据结构】单链表的删除，插入，销毁操作实现

#include <iostream>
using namespace std;
struct Node
{
	int data;
	Node* next;
};
class Linklist
{
public:
	//初始化
	void init()
	{
		head = new Node;
		head->next = NULL;
		len = 0;
	}
	void output()
	{
		cout << "长度" << len << endl;
		if (len>0)
		{
			cout << "内容:";
			Node* p = head->next;
			for (int  i = 0; i < len; i++)
			{
				cout << p->data << " ";
				p = p->next;
			}
			cout<<endl;
		}
	}
   //插入
	void insert( int n,int value)//此处n为链表的长度
	{
		Node* p = head;
		for (int  i = 0; i < n-1; i++)
		{
			p = p->next;
		}
		Node* q = new Node;
		q->data = value;
		q->next = NULL;
		//insert
		q->next = p->next;
		p->next = q;
		len++;

	}
	int Getlen()
	{
		return len;
	}
	//删除操作
	void Delete (int pos, int*value)//传入要删除的结点内容的地址
	{
		//Linklist* p = head;   linklist
		Node* p =