2021-11-07

最近在学校学数据结构也算是学到一半，借着复习，分享一下自己的代码，这一块是链表的一些基本操作，不定时会写一点，方便自己练习，下面只是链表的一些基本的初始化，插入，删除的一些方法，比较简单，当然是面向对象的编程，所以基本摈弃了结构体的定义方式

#include<iostream>
using namespace std;

class linklist;
class linknode {
	friend class linklist;//将链表类设为友元类
	int data;
	linknode* next;
	int a;
};
class linklist {
private:
	linknode* first;
public:
	linklist();
	~linklist();
	void Init(int n);//初始化链表
	void output1(int n);//第一种输出的方式
	void output2();//第二种输出方式和第一个有所不同
	int countlist();//计数链表有几个节点
	void solve();//解答力扣上面的一道题，删除倒数第N个节点
	void insert(int m);//插入节点节点对应的值是m
	void deletenum();//删除链表里的一个节点

	
};
linklist::linklist() {
	first = new linknode;
	first->data = 0;
	first->next = NULL;
}
linklist::~linklist() {
	delete first;
}
void linklist::Init(int n) {
	linknode* p, * q;
	q = first;
	for (int i = 0; i < n; i++) {
		p = new linknode;
		cin >> p->data;
		p->next = NULL;
		q->next = p;
		q = p;

	}
	cout << "存储成功\n";
}
void linklist::output1(int n) {
	linknode* p=first;
	if (first == NULL || first->next == NULL) {
		cout << "链表为空表" << endl;
	}
	for(int i=0;i<n;i++)
	{
		p = p->next;
		cout << p->data<<" ";
	}
	cout << endl;
}
void linklist::output2() {
	linknode* p = first;
	if (first == NULL || first->next == NULL) {
		cout << "链表为空表" << endl;
	}
	while(p->next!=NULL)
	{
		p = p->next;
		cout << p->data << " ";
	}
	cout << endl;
}
int linklist::countlist() {
	int m = 0;
	linknode* q = first->next;
	while (q != NULL)
	{
		m += 1;
		q = q->next;
	}

	return m;
}
void linklist::solve() {
	int x,l;
	cout << "please cin your count number:" << endl;
	cin >> x;
	l = countlist();
	linknode* p = first->next;
	linknode* q = first;
	for (int i = 0; i < l - x; i++)
	{
		q = q->next;
		p = p->next;
	}
	q->next = p->next;
	q = p;
	delete p;
}
void linklist::insert(int m) {
	cout << "input your insert location" << endl;
	int location;
	cin >> location;
	linknode* p = first;
	
	if (p == NULL)
		return;
	else {
		for (int i = 1; i < location; i++)
		{
			p = p->next;
		}
		linknode* node = new linknode;
		node->data = m;
		node->next = p->next;
		p->next = node;
	}
}
void linklist::deletenum()
{
	cout << "please input delete location:" << endl;
	int loc;
	cin >> loc;
	linknode* p = first;
	linknode* q = first->next;
	for (int i = 1; i < loc; i++) {
		p = p->next;
		q = q->next;
	}
	p->next = q->next;
	delete q;
}
void linklist::addtwolist(linklist& T1, linklist& T2) {

}


int main() {
	linklist T;
	int n;
	cout << "please input list number" << endl;
	cin >> n;
	T.Init(n);
	cout << "您输入的链表是：" << endl;
	T.output1(n);
	T.solve();
	T.output1(n-1);
	cout << "请输入您要插入的数据" << endl;
	int Data;
	cin >> Data;
	T.insert(Data);
	T.output2();
	T.deletenum();
	T.output2();
	return 0;
}