数据结构（二）————单链表

#pragma once
#include
#include<stdlib.h>
#include
#include
using namespace std;

//点类的定义
template
class node {
public:
elem val;
node* next;
node(elem &v, node* x) { val = v; next = x; }
node(node* n = NULL) { next = n; }
};

//链表类的定义
template
class Llist:public node {
private:
node* cur, * head, * tail;//现在，头，尾
int size;
public:
Llist() { cur = head = tail = new node; }
~Llist() {
while (head != NULL)
{
cur = head;
head = head->next;
delete cur;
}
}

//打印
void print() {
	std::cout << head->val<<cur->val<<tail->val<<std::endl;
}
void create(int n)
{
	this->size = n;
	node<elem>* p = new node<elem>();
	node<elem>* q = new node<elem>();
	p = this->head;
	for (int i = 0; i < n; i++)
	{
		q = new node<elem>();
		std::cin >> q->val;
		p->next = q;
		p = q;
	}
	this->tail = p;
	cur = p;
}

void set_cur(int n) {
	if (n > this->size)throw "wrong parameter";
	node<elem>* p = new node<elem>;
	node<elem>* q;
	p = head;
	for (int i = 0; i < n; i++)
	{
		q = p->next;
		p = q;
	}
	cur = p;
}
void insert(elem a) {
	node<elem>* p = new node<elem>;
	p->next = cur->next;
	cur -> next = p;
	p->val = a; 
	
}

//删除cur的下一个结点
void del_node() {
	node* p = new node;
	p = cur -> next;
	cur->next = p->next;
	delete p;
}

};

#include"标头.h"
int main()
{
Llist list;
int i = 0;
list.create(4);
while (i<4)
{
list.set_cur(i);
list.print();
std::cout << “->”;
i++;
}
return 0;
}