数据结构链表题目1：查找、插入、删除基本操作 解析

最新推荐文章于 2024-10-01 22:18:56 发布
最新推荐文章于 2024-10-01 22:18:56 发布
阅读量463 收藏 1
点赞数
分类专栏： C++
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/Perce_Issac/article/details/82828716
版权

1.链表的查找插入删除

有问题的代码：

#include<iostream>
#define ok 0
#define error -1
using namespace std;


class ListNode {
public:
	int data;
	ListNode*next;
	ListNode() {
		next = NULL;
	}
};

class LinkList {
public:
	ListNode * head;
	int len;
	LinkList();
	~LinkList();
	ListNode*LL_index(int i);
	int LL_get(int i);
	int LL_insert(int i, int item);
	int LL_del(int i);
	void LL_Create();
	void LL_display();
};

LinkList::LinkList() {
	head = new ListNode();
	len = 0;
}
LinkList::~LinkList() {
	ListNode*p, *q;
	p = head;
	while (p != NULL) {
		q = p;
		p = p->next;
		delete q;
	}
	len = 0;
	head = NULL;
}

void LinkList::LL_Create() {
	ListNode*pS;
	ListNode*pEnd;
	pS = new ListNode;
	cin >> len;
	cin >> pS->data;
	head->next = NULL;
	pEnd = pS;
	while (pS->data) {
		if (head->next == NULL)
			head->next = pS;
		else
			pEnd->next = pS;
		pEnd = pS;
		pS = new ListNode;
		cin >> pS->data;
		cout << head->next<<" ";
	}
	pEnd->next = NULL;
	delete pS;
	cout << head->next << " "<<endl;//没有出去
	//return;
}
void LinkList::LL_display() {
	cout << len << " ";
	ListNode *p;
	p = head->next;
	while (p) {
		cout << p->data << " ";
		p = p->next;
	}
	cout << endl;
}
ListNode* LinkList::LL_index(int i) {
	int j=1;
	for (ListNode*pG = head->next; pG->next,j<=i; pG = pG->next,j++) {
		if (j == i) {
			return pG;
		}
	}
}

int LinkList::LL_get(int i) {
	ListNode*num = LL_index(i);
	return num->data;
	return error;
}

int LinkList::LL_insert(int i,int item) {
	ListNode*pI = new ListNode;
	if (!head->next&&i==1) {
		head->next = pI;
		pI->data = item;
		pI->next = NULL;
		return ok;
	}
	int j = 0;
	ListNode*pG = head->next;
	while (pG&&j < i - 1) {
		pG = pG->next;
		j++;
	}
	if (!pG || j > i - 1)
		return error;
	pI->next = pG->next;
	pG->next = pI;
	pI->data = item;
	len++;
	return ok;
}
int LinkList::LL_del(int i) {
	ListNode*pI = new ListNode;
	int j = 0;
	ListNode*pG = head;
	while (pG->next&&j < i - 1) {
		pG = pG->next;
		j++;
	}
	if (!pG || j > i - 1)
		return error;
	pI = pG->next;
	pG->next = pI->next;
	delete pI;
	len--;
	return ok;
}

int main() {
	LinkList sa;
	sa.LL_Create();
	sa.LL_display();
	int i, item, k;

	cin >> i >> item;
	k=sa.LL_insert(i,item);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;
	k = sa.LL_insert(i, item);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i;
	k=sa.LL_del(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;
	cin >> i;
	k=sa.LL_del(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i;
	k=sa.LL_get(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;
	cin >> i;
	k = sa.LL_get(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	return 0;
}

在输入数据后没反应，判断是while循环没有走出来，以至于在 LL_Create() 函数中没有出去

修改：用 --len 来作为 while 的判断条件，更加简洁清晰：

#include<iostream>
#define ok 0
#define error -1
using namespace std;


class ListNode {
public:
	int data;
	ListNode*next;
	ListNode() {
		next = NULL;
	}
};

class LinkList {
public:
	ListNode * head;
	int len;
	LinkList();
	~LinkList();
	ListNode*LL_index(int i);
	int LL_get(int i);
	int LL_insert(int i, int item);
	int LL_del(int i);
	void LL_Create();
	void LL_display();
};

LinkList::LinkList() {
	head = new ListNode();
	len = 0;
}
LinkList::~LinkList() {
	ListNode*p, *q;
	p = head;
	while (p != NULL) {
		q = p;
		p = p->next;
		delete q;
	}
	len = 0;
	head = NULL;
}

void LinkList::LL_Create() {
	ListNode*pS;
	ListNode*pEnd;
	pS = new ListNode;
	cin >> len;
	cin >> pS->data;
	head->next = NULL;
	pEnd = pS;
	while (--len) {
		if (head->next == NULL)
			head->next = pS;
		else
			pEnd->next = pS;
		pEnd = pS;
		pS = new ListNode;
		cin >> pS->data;
		cout << head->next<<" ";
	}
	pEnd->next = NULL;
	delete pS;
	cout << head->next << " "<<endl;//没有出去
	//return;
}
void LinkList::LL_display() {
	cout << len << " ";
	ListNode *p;
	p = head->next;
	while (p) {
		cout << p->data << " ";
		p = p->next;
	}
	cout << endl;
}
ListNode* LinkList::LL_index(int i) {
	int j=1;
	for (ListNode*pG = head->next; pG->next,j<=i; pG = pG->next,j++) {
		if (j == i) {
			return pG;
		}
	}
}

int LinkList::LL_get(int i) {
	ListNode*num = LL_index(i);
	return num->data;
	return error;
}

int LinkList::LL_insert(int i,int item) {
	ListNode*pI = new ListNode;
	if (!head->next&&i==1) {
		head->next = pI;
		pI->data = item;
		pI->next = NULL;
		return ok;
	}
	int j = 0;
	ListNode*pG = head->next;
	while (pG&&j < i - 1) {
		pG = pG->next;
		j++;
	}
	if (!pG || j > i - 1)
		return error;
	pI->next = pG->next;
	pG->next = pI;
	pI->data = item;
	len++;
	return ok;
}
int LinkList::LL_del(int i) {
	ListNode*pI = new ListNode;
	int j = 0;
	ListNode*pG = head;
	while (pG->next&&j < i - 1) {
		pG = pG->next;
		j++;
	}
	if (!pG || j > i - 1)
		return error;
	pI = pG->next;
	pG->next = pI->next;
	delete pI;
	len--;
	return ok;
}

int main() {
	LinkList sa;
	sa.LL_Create();
	sa.LL_display();
	int i, item, k;

	cin >> i >> item;
	k=sa.LL_insert(i,item);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;
	k = sa.LL_insert(i, item);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i;
	k=sa.LL_del(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;
	cin >> i;
	k=sa.LL_del(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i;
	k=sa.LL_get(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;
	cin >> i;
	k = sa.LL_get(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	return 0;
}

此时发现输出语句出了问题

其实还是赋值语句的while循环出了问题，为什么认为这道题和课本上结构部分的链表是一样的呢？一定要吸取教训

#include<iostream>
#define ok 0
#define error -1
using namespace std;


class ListNode {
public:
	int data;
	ListNode*next;
	ListNode() {
		next = NULL;
	}
};

class LinkList {
public:
	ListNode * head;
	int len;
	LinkList();
	~LinkList();
	ListNode*LL_index(int i);
	int LL_get(int i);
	int LL_insert(int i, int item);
	int LL_del(int i);
	void LL_Create();
	void LL_display();
};

LinkList::LinkList() {
	head = new ListNode();
	len = 0;
}
LinkList::~LinkList() {
	ListNode*p, *q;
	p = head;
	while (p != NULL) {
		q = p;
		p = p->next;
		delete q;
	}
	len = 0;
	head = NULL;
}

void LinkList::LL_Create() {
	ListNode*pS;
	ListNode*pEnd;
	pS = new ListNode;
	cin >> len;
	cin >> pS->data;
	head->next = pS;
	pEnd = pS;
	int q = len;
	while (--q) {
		pEnd = pS;
		pS = new ListNode;
		cin >> pS->data;
		pEnd->next = pS;
	}
	
	cout <<"++++"<< head->next->next->next->data<<endl;
	pEnd->next = NULL;
	delete pS;
	return;
}
void LinkList::LL_display() {
	cout << len << " ";
	ListNode *p;
	p = head->next;
	while (p) {
		cout << p->data << " ";
		p = p->next;
		cout << " &*(*& ";
	}
	cout << endl;
}
ListNode* LinkList::LL_index(int i) {
	int j=1;
	for (ListNode*pG = head->next; pG->next,j<=i; pG = pG->next,j++) {
		if (j == i) {
			return pG;
		}
	}
}

int LinkList::LL_get(int i) {
	ListNode*num = LL_index(i);
	return num->data;
	return error;
}

int LinkList::LL_insert(int i,int item) {
	ListNode*pI = new ListNode;
	if (!head->next&&i==1) {
		head->next = pI;
		pI->data = item;
		pI->next = NULL;
		return ok;
	}
	int j = 0;
	ListNode*pG = head->next;
	while (pG&&j < i - 1) {
		pG = pG->next;
		j++;
	}
	if (!pG || j > i - 1)
		return error;
	pI->next = pG->next;
	pG->next = pI;
	pI->data = item;
	len++;
	return ok;
}
int LinkList::LL_del(int i) {
	ListNode*pI = new ListNode;
	int j = 0;
	ListNode*pG = head;
	while (pG->next&&j < i - 1) {
		pG = pG->next;
		j++;
	}
	if (!pG || j > i - 1)
		return error;
	pI = pG->next;
	pG->next = pI->next;
	delete pI;
	len--;
	return ok;
}

int main() {
	LinkList sa;
	sa.LL_Create();
	sa.LL_display();
	int i, item, k;

	cin >> i >> item;
	k=sa.LL_insert(i,item);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;
	k = sa.LL_insert(i, item);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i;
	k=sa.LL_del(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;
	cin >> i;
	k=sa.LL_del(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i;
	k=sa.LL_get(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;
	cin >> i;
	k = sa.LL_get(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	return 0;
}

现在是输出语句有问题了

#include<iostream>
#define ok 0
#define error -1
using namespace std;


class ListNode {
public:
	int data;
	ListNode*next;
	ListNode() {
		next = NULL;
	}
};

class LinkList {
public:
	ListNode * head;
	int len;
	LinkList();
	~LinkList();
	ListNode*LL_index(int i);
	int LL_get(int i);
	int LL_insert(int i, int item);
	int LL_del(int i);
	void LL_Create();
	void LL_display();
};

LinkList::LinkList() {
	head = new ListNode();
	len = 0;
}
LinkList::~LinkList() {
	ListNode*p, *q;
	p = head;
	while (p != NULL) {
		q = p;
		p = p->next;
		delete q;
	}
	len = 0;
	head = NULL;
}

void LinkList::LL_Create() {
	ListNode*pS;
	ListNode*pEnd;
	pS = new ListNode;
	cin >> len;
	cin >> pS->data;
	head->next = pS;
	pEnd = pS;
	int q = len;
	while (--q) {
		pEnd = pS;
		pS = new ListNode;
		cin >> pS->data;
		pEnd->next = pS;
	}
	pS->next = NULL;
	pEnd = pS;
	delete pS;
	return;
}
void LinkList::LL_display() {
	cout << len << " ";
	int q = len;
	ListNode *p;
	p = head->next;
	while (p) {
		cout << p->data << " ";
		p = p->next;
	}
	cout << endl;
}
ListNode* LinkList::LL_index(int i) {
	int j=1;
	for (ListNode*pG = head->next; pG->next,j<=i; pG = pG->next,j++) {
		if (j == i) {
			return pG;
		}
	}
}

int LinkList::LL_get(int i) {
	ListNode*num = LL_index(i);
	return num->data;
	return error;
}

int LinkList::LL_insert(int i,int item) {
	ListNode*pI = new ListNode;
	if (!head->next&&i==1) {
		head->next = pI;
		pI->data = item;
		pI->next = NULL;
		return ok;
	}
	int j = 0;
	ListNode*pG = head->next;
	while (pG&&j < i - 1) {
		pG = pG->next;
		j++;
	}
	if (!pG || j > i - 1)
		return error;
	pI->next = pG->next;
	pG->next = pI;
	pI->data = item;
	len++;
	return ok;
}
int LinkList::LL_del(int i) {
	ListNode*pI = new ListNode;
	int j = 0;
	ListNode*pG = head;
	while (pG->next&&j < i - 1) {
		pG = pG->next;
		j++;
	}
	if (!pG || j > i - 1)
		return error;
	pI = pG->next;
	pG->next = pI->next;
	delete pI;
	len--;
	return ok;
}

int main() {
	LinkList sa;
	sa.LL_Create();
	sa.LL_display();
	int i, item, k;

	cin >> i >> item;
	k=sa.LL_insert(i,item);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;
	k = sa.LL_insert(i, item);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i;
	k=sa.LL_del(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;
	cin >> i;
	k=sa.LL_del(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i;
	k=sa.LL_get(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;
	cin >> i;
	k = sa.LL_get(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	return 0;
}

为什么最后一个元素一直不能正确输出，会爆掉。

#include<iostream>
#define ok 0
#define error -1
using namespace std;


class ListNode {
public:
	int data;
	ListNode*next;
	ListNode() {
		next = NULL;
	}
};

class LinkList {
public:
	ListNode * head;
	int len;
	LinkList();
	~LinkList();
	ListNode*LL_index(int i);
	int LL_get(int i);
	int LL_insert(int i, int item);
	int LL_del(int i);
	void LL_Create();
	void LL_display();
};

LinkList::LinkList() {
	head = new ListNode();
	len = 0;
}
LinkList::~LinkList() {
	ListNode*p, *q;
	p = head;
	while (p != NULL) {
		q = p;
		p = p->next;
		delete q;
	}
	len = 0;
	head = NULL;
}

void LinkList::LL_Create() {
	ListNode*pS;
	ListNode*pEnd;
	pS = new ListNode;
	cin >> len;
	cin >> pS->data;
	head->next = pS;
	pEnd = pS;
	int q = len;
	while (--q) {
		pEnd = pS;
		pS = new ListNode;
		cin >> pS->data;
		pEnd->next = pS;
	}
	pS->next = NULL;
	pEnd = pS;
	delete pS;
	return;
}
void LinkList::LL_display() {
	cout << len << " ";
	int q = len;
	ListNode *p;
	p = head->next;
	while (p) {
		cout << p->data << " ";
		p = p->next;
	}
	cout << endl;
}
ListNode* LinkList::LL_index(int i) {
	int j=1;
	for (ListNode*pG = head->next; pG->next,j<=i; pG = pG->next,j++) {
		if (j == i) {
			return pG;
		}
	}
}

int LinkList::LL_get(int i) {
	ListNode*num = LL_index(i);
	return num->data;
	return error;
}

int LinkList::LL_insert(int i,int item) {
	ListNode*pI = new ListNode;
	if (!head->next&&i==1) {
		head->next = pI;
		pI->data = item;
		pI->next = NULL;
		return ok;
	}
	int j = 0;
	ListNode*pG = head->next;
	while (pG&&j < i - 1) {
		pG = pG->next;
		j++;
	}
	if (!pG || j > i - 1)
		return error;
	pI->next = pG->next;
	pG->next = pI;
	pI->data = item;
	len++;
	return ok;
}
int LinkList::LL_del(int i) {
	ListNode*pI = new ListNode;
	int j = 0;
	ListNode*pG = head;
	while (pG->next&&j < i - 1) {
		pG = pG->next;
		j++;
	}
	if (!pG || j > i - 1)
		return error;
	pI = pG->next;
	pG->next = pI->next;
	delete pI;
	len--;
	return ok;
}

int main() {
	LinkList sa;
	sa.LL_Create();
	sa.LL_display();
	int i, item, k;

	cin >> i >> item;
	k=sa.LL_insert(i,item);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;
	k = sa.LL_insert(i, item);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i;
	k=sa.LL_del(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;
	cin >> i;
	k=sa.LL_del(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i;
	k=sa.LL_get(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;
	cin >> i;
	k = sa.LL_get(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	return 0;
}

发现在输入的时候最后一个没有成功输入数据

void LinkList::LL_Create() {
	ListNode*pS;
	ListNode*pEnd;
	pS = new ListNode;
	cin >> len;
	cin >> pS->data;
	head->next = pS;
	pEnd = pS;
	int q = len;
	while (--q) {
		pEnd = pS;
		pS = new ListNode;
		cin >> pS->data;
		pEnd->next = pS;
	}
	pS->next = NULL;
	pEnd = pS;
	delete pS;
	cout << endl << pEnd->data << endl;
	return;
}

改了好久还是有问题，太烦了

#include<iostream>
#define ok 0
#define error -1
using namespace std;


class ListNode {
public:
	int data;
	ListNode*next;
	ListNode() {
		next = NULL;
	}
};

class LinkList {
public:
	ListNode * head;
	int len;
	LinkList();
	~LinkList();
	ListNode*LL_index(int i);
	int LL_get(int i);
	int LL_insert(int i, int item);
	int LL_del(int i);
	void LL_Create();
	void LL_display();
};

LinkList::LinkList() {
	head = new ListNode();
	len = 0;
}
LinkList::~LinkList() {
	ListNode*p, *q;
	p = head;
	while (p != NULL) {
		q = p;
		p = p->next;
		delete q;
	}
	len = 0;
	head = NULL;
}

void LinkList::LL_Create() {
	ListNode*pS;
	ListNode*pEnd;
	pS = new ListNode;
	cin >> len;
	cin >> pS->data;
	head->next = pS;
	pEnd = pS;
	//delete pS;
	int q = len;
	while (--q) {
		pS = new ListNode;
		cin >> pS->data;
		pEnd->next = pS;
		pEnd = pS;
	}
	pEnd->next = NULL;
	cout << head->next->data<<endl;
	cout << head->next->next->data << endl;
	cout << head->next->next->next->data << endl;
	cout << pEnd->data;
	delete pS;
	return;
}
void LinkList::LL_display() {
	cout << len << " ";
	ListNode *p;
	p = head->next;
	while (p->next!=NULL) {
		cout << p->data << " ";
		p = p->next;
	}
	cout << endl;
}
ListNode* LinkList::LL_index(int i) {
	int j=1;
	for (ListNode*pG = head->next; pG->next,j<=i; pG = pG->next,j++) {
		if (j == i) {
			return pG;
		}
	}
}

int LinkList::LL_get(int i) {
	ListNode*num = LL_index(i);
	return num->data;
	return error;
}

int LinkList::LL_insert(int i,int item) {
	ListNode*pI = new ListNode;
	if (!head->next&&i==1) {
		head->next = pI;
		pI->data = item;
		pI->next = NULL;
		return ok;
	}
	int j = 0;
	ListNode*pG = head->next;
	while (pG&&j < i - 1) {
		pG = pG->next;
		j++;
	}
	if (!pG || j > i - 1)
		return error;
	pI->next = pG->next;
	pG->next = pI;
	pI->data = item;
	len++;
	return ok;
}
int LinkList::LL_del(int i) {
	ListNode*pI = new ListNode;
	int j = 0;
	ListNode*pG = head;
	while (pG->next&&j < i - 1) {
		pG = pG->next;
		j++;
	}
	if (!pG || j > i - 1)
		return error;
	pI = pG->next;
	pG->next = pI->next;
	delete pI;
	len--;
	return ok;
}

int main() {
	LinkList sa;
	sa.LL_Create();
	sa.LL_display();
	int i, item, k;

	cin >> i >> item;
	k=sa.LL_insert(i,item);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;
	k = sa.LL_insert(i, item);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i;
	k=sa.LL_del(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;
	cin >> i;
	k=sa.LL_del(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i;
	k=sa.LL_get(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;
	cin >> i;
	k = sa.LL_get(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	return 0;
}

搞到现在搞不还我真的有点难受

#include<iostream>
#define ok 0
#define error -1
using namespace std;
class ListNode {
public:
	int data;
	ListNode*next;
	ListNode() {
		next = NULL;
	}
};

class LinkList {
public:
	ListNode * head;
	int len;
public:
	LinkList();
	~LinkList();
	ListNode*LL_index(int i);
	int LL_get(int i);
	int LL_insert(int i, int item);
	int LL_del(int i);
	void LL_Create();
	void LL_display();
};
LinkList::LinkList() {
	head = new ListNode();
	len = 0;
}
LinkList::~LinkList() {
	ListNode*p, *q;
	p = head;
	while (p != NULL) {
		q = p;
		p = p->next;
		delete q;
	}
	len = 0;
	head = NULL;
}
void LinkList::LL_Create() {
	/*ListNode*pS = new ListNode;
	ListNode*pEnd;
	cin >> len;
	cin >> pS->data;
	head->next = pS;
	pEnd = pS;
	int q = len;
	//delete pS;
	while (--q) {
		pS = new ListNode;
		cin >> pS->data;
		pEnd->next = pS;
		pEnd = pS;
		//delete pS;
	}
	pEnd->next = NULL;
	delete pS;
	cout << head->next->data << endl;
	cout << head->next->next->data << endl;
	cout << head->next->next->next->data << endl;
	cout << pEnd->data;*/
	
	ListNode *temp = head;
	ListNode *ps;
	cin>>len;
	for(int i=0; i<len; i++){
	ps = new ListNode;
	cin>>ps->data;
	ps->next = temp->next;
	temp->next = ps;
	temp = temp->next;
	delete []ps;
	}
}
void LinkList::LL_display() {
	cout << len << " ";
	ListNode *p = head->next;
	while (p != NULL) {
		cout << p->data << " ";
		p = p->next;
	}
	cout << endl;
}
ListNode* LinkList::LL_index(int i) {
	int j = 1;
	for (ListNode*pG = head->next; pG->next, j <= i; pG = pG->next, j++) {
		if (j == i) {
			return pG;
		}
	}
}

int LinkList::LL_get(int i) {
	ListNode*num = LL_index(i);
	return num->data;
	return error;
}

int LinkList::LL_insert(int i, int item) {
	ListNode*pI = new ListNode;
	if (!head->next&&i == 1) {
		head->next = pI;
		pI->data = item;
		pI->next = NULL;
		return ok;
	}
	int j = 0;
	ListNode*pG = head->next;
	while (pG&&j < i - 1) {
		pG = pG->next;
		j++;
	}
	if (!pG || j > i - 1)
		return error;
	pI->next = pG->next;
	pG->next = pI;
	pI->data = item;
	len++;
	return ok;
}
int LinkList::LL_del(int i) {
	ListNode*pI = new ListNode;
	int j = 0;
	ListNode*pG = head;
	while (pG->next&&j < i - 1) {
		pG = pG->next;
		j++;
	}
	if (!pG || j > i - 1)
		return error;
	pI = pG->next;
	pG->next = pI->next;
	delete pI;
	len--;
	return ok;
}

int main() {
	LinkList sa;
	sa.LL_Create();
	sa.LL_display();
	int i, item, k;

	cin >> i >> item;
	k = sa.LL_insert(i, item);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;
	k = sa.LL_insert(i, item);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i;
	k = sa.LL_del(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;
	cin >> i;
	k = sa.LL_del(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i;
	k = sa.LL_get(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;
	cin >> i;
	k = sa.LL_get(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	return 0;
}

做了一些修改，有很大的进步：

#include<iostream>
#define ok 0
#define error -1
using namespace std;
class ListNode {
public:
	int data;
	ListNode*next;
	ListNode() {
		next = NULL;
	}
};

class LinkList {
public:
	ListNode * head;
	int len;
public:
	LinkList();
	~LinkList();
	ListNode*LL_index(int i);
	int LL_get(int i);
	int LL_insert(int i, int item);
	int LL_del(int i);
	void LL_display();
};
LinkList::LinkList() {
	head = new ListNode();
	len = 0;
}
LinkList::~LinkList() {
	ListNode*p, *q;
	p = head;
	while (p != NULL) {
		q = p;
		p = p->next;
		delete q;
	}
	len = 0;
	head = NULL;
}
void LinkList::LL_display() {
	ListNode *p = head->next;
	while (p != NULL) {
		cout << p->data << " ";
		p = p->next;
	}
	cout << endl;
}
ListNode* LinkList::LL_index(int i) {
	int j = 1;
	for (ListNode*pG = head->next; pG->next, j <= i; pG = pG->next, j++) {
		if (j == i) {
			return pG;
		}
	}
}

int LinkList::LL_get(int i) {
	ListNode*num = LL_index(i);
	return num->data;
	return error;
}

int LinkList::LL_insert(int i, int item) {
	ListNode*pI = new ListNode;
	if (!head->next&&i == 1) {
		head->next = pI;
		pI->data = item;
		pI->next = NULL;
		len++;
		return ok;
	}
	int j = 0;
	ListNode*pG = head;
	while (pG->next&&j < i - 1) {
		pG = pG->next;
		j++;
	}
	if (!pG || j > i - 1)
		return error;
	ListNode*pU = new ListNode;
	pU->next = pG->next;
	pG->next = pU;
	pU->data = item;
	len++;
	return ok;
}
int LinkList::LL_del(int i) {
	ListNode*pI = new ListNode;
	int j = 0;
	ListNode*pG = head;
	while (pG->next&&j < i - 1) {
		pG = pG->next;
		j++;
	}
	if (!pG || j > i - 1)
		return error;
	pI = pG->next;
	pG->next = pI->next;
	delete pI;
	len--;
	return ok;
}

int main() {
	LinkList sa;
	int num;
	cin >> num;
	int number;
	for (int i = 0; i < num; i++) {
		cin >> number;
		sa.LL_insert(i + 1, number);
		if (i == num-1)
			break;//什么情况？
	}
	sa.LL_display();

	int i, item, k;

	cin >> i >> item;
	k = sa.LL_insert(i, item);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i >> item;
	k = sa.LL_insert(i, item);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i;
	k = sa.LL_del(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i;
	k = sa.LL_del(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i;
	k = sa.LL_get(i);
	if (k == -1)
		cout << "error" << endl;
	else
		cout << k << endl;
	cin >> i;
	k = sa.LL_get(i);
	if (k == -1)
		cout << "error" << endl;
	else
		cout << k << endl;

	return 0;
}

目前的输入、输出、插入都没有问题，但是删除的情况下对于超出链表范围的数据没有报错，并且影响下一步运行

终于我排除了所有问题，但是在for循环处还有一点奇怪

#include<iostream>
#define ok 0
#define error -1
using namespace std;
class ListNode {
public:
	int data;
	ListNode*next;
	ListNode() {
		next = NULL;
	}
};

class LinkList {
public:
	ListNode * head;
	int len;
public:
	LinkList();
	~LinkList();
	ListNode*LL_index(int i);
	int LL_get(int i);
	int LL_insert(int i, int item);
	int LL_del(int i);
	void LL_display();
};
LinkList::LinkList() {
	head = new ListNode();
	len = 0;
}
LinkList::~LinkList() {
	ListNode*p, *q;
	p = head;
	while (p != NULL) {
		q = p;
		p = p->next;
		delete q;
	}
	len = 0;
	head = NULL;
}
void LinkList::LL_display() {
	ListNode *p = head->next;
	while (p != NULL) {
		cout << p->data << " ";
		p = p->next;
	}
	cout << endl;
}
ListNode* LinkList::LL_index(int i) {
	if (i > len || i < 1) {
		return NULL;
	}
	int j = 1;
	for (ListNode*pG = head->next; pG->next, j <= i; pG = pG->next, j++) {
		if (j == i) {
			return pG;
		}
	}
}

int LinkList::LL_get(int i) {
	ListNode*num = LL_index(i);
	if(num==NULL)
		return error;
	else	
		return num->data;
	
}

int LinkList::LL_insert(int i, int item) {
	ListNode*pI = new ListNode;
	if (!head->next&&i == 1) {
		head->next = pI;
		pI->data = item;
		pI->next = NULL;
		len++;
		return ok;
	}
	int j = 0;
	ListNode*pG = head;
	while (pG->next&&j < i - 1) {
		pG = pG->next;
		j++;
	}
	if (!pG || j > i - 1)
		return error;
	ListNode*pU = new ListNode;
	pU->next = pG->next;
	pG->next = pU;
	pU->data = item;
	len++;
	return ok;
}
int LinkList::LL_del(int i) {
	if (i > len||i<1)
		return error;
	ListNode*pI = new ListNode;
	int j = 0;
	ListNode*pG = head;
	while (pG->next&&j < i - 1) {
		pG = pG->next;
		j++;
	}
	if (!pG || j > i - 1)
		return error;
	pI = pG->next;
	pG->next = pI->next;
	delete pI;
	len--;
	return ok;
}

int main() {
	LinkList sa;
	int num;
	cin >> num;
	int number;
	for (int i = 0; i < num; i++) {
		cin >> number;
		sa.LL_insert(i + 1, number);
		if (i == num-1)
			break;//什么情况？
	}
	sa.LL_display();

	int i, item, k;

	cin >> i >> item;
	k = sa.LL_insert(i, item);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i >> item;
	k = sa.LL_insert(i, item);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i;
	k = sa.LL_del(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i;
	k = sa.LL_del(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i;
	k = sa.LL_get(i);
	if (k == -1)
		cout << "error" << endl;
	else
		cout << k << endl;
	cin >> i;
	k = sa.LL_get(i);
	if (k == -1)
		cout << "error" << endl;
	else
		cout << k << endl;

	return 0;
}

注释掉，编译成功

#include<iostream>
#define ok 0
#define error -1
using namespace std;
class ListNode {
public:
	int data;
	ListNode*next;
	ListNode() {
		next = NULL;
	}
};

class LinkList {
public:
	ListNode * head;
	int len;
public:
	LinkList();
	~LinkList();
	ListNode*LL_index(int i);
	int LL_get(int i);
	int LL_insert(int i, int item);
	int LL_del(int i);
	void LL_display();
};
LinkList::LinkList() {
	head = new ListNode();
	len = 0;
}
LinkList::~LinkList() {
	ListNode*p, *q;
	p = head;
	while (p != NULL) {
		q = p;
		p = p->next;
		delete q;
	}
	len = 0;
	head = NULL;
}
void LinkList::LL_display() {
	ListNode *p = head->next;
	while (p != NULL) {
		cout << p->data << " ";
		p = p->next;
	}
	cout << endl;
}
ListNode* LinkList::LL_index(int i) {
	if (i > len || i < 1) {
		return NULL;
	}
	int j = 1;
	for (ListNode*pG = head->next; pG->next, j <= i; pG = pG->next, j++) {
		if (j == i) {
			return pG;
		}
	}
}

int LinkList::LL_get(int i) {
	ListNode*num = LL_index(i);
	if(num==NULL)
		return error;
	else	
		return num->data;
	
}

int LinkList::LL_insert(int i, int item) {
	ListNode*pI = new ListNode;
	if (!head->next&&i == 1) {
		head->next = pI;
		pI->data = item;
		pI->next = NULL;
		len++;
		return ok;
	}
	int j = 0;
	ListNode*pG = head;
	while (pG->next&&j < i - 1) {
		pG = pG->next;
		j++;
	}
	if (!pG || j > i - 1)
		return error;
	ListNode*pU = new ListNode;
	pU->next = pG->next;
	pG->next = pU;
	pU->data = item;
	len++;
	return ok;
}
int LinkList::LL_del(int i) {
	if (i > len||i<1)
		return error;
	ListNode*pI = new ListNode;
	int j = 0;
	ListNode*pG = head;
	while (pG->next&&j < i - 1) {
		pG = pG->next;
		j++;
	}
	if (!pG || j > i - 1)
		return error;
	pI = pG->next;
	pG->next = pI->next;
	delete pI;
	len--;
	return ok;
}

int main() {
	LinkList sa;
	int num;
	cin >> num;
	int number;
	for (int i = 0; i < num; i++) {
		cin >> number;
		sa.LL_insert(i + 1, number);
	}
	sa.LL_display();

	int i, item, k;

	cin >> i >> item;
	k = sa.LL_insert(i, item);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i >> item;
	k = sa.LL_insert(i, item);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i;
	k = sa.LL_del(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i;
	k = sa.LL_del(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i;
	k = sa.LL_get(i);
	if (k == -1)
		cout << "error" << endl;
	else
		cout << k << endl;
	cin >> i;
	k = sa.LL_get(i);
	if (k == -1)
		cout << "error" << endl;
	else
		cout << k << endl;

	return 0;
}

答案错误50%，有希望，还差一点点，加油。

终于提交成功！

特殊的数据没有考虑到，对错误输入范围的界定不正确，并且没考虑负数的情况

#include<iostream>
#define ok 0
#define error -1
using namespace std;
class ListNode {
public:
	int data;
	ListNode*next;
	ListNode() {
		next = NULL;
	}
};

class LinkList {
public:
	ListNode * head;
	int len;
public:
	LinkList();
	~LinkList();
	ListNode*LL_index(int i);
	int LL_get(int i);
	int LL_insert(int i, int item);
	int LL_del(int i);
	void LL_display();
};
LinkList::LinkList() {
	head = new ListNode();
	len = 0;
}
LinkList::~LinkList() {
	ListNode*p, *q;
	p = head;
	while (p != NULL) {
		q = p;
		p = p->next;
		delete q;
	}
	len = 0;
	head = NULL;
}
void LinkList::LL_display() {
	ListNode *p = head->next;
	while (p != NULL) {
		cout << p->data << " ";
		p = p->next;
	}
	cout << endl;
}
ListNode* LinkList::LL_index(int i) {
	if (i > len || i < 1) {
		return NULL;
	}
	int j = 1;
	for (ListNode*pG = head->next; pG->next, j <= i; pG = pG->next, j++) {
		if (j == i) {
			return pG;
		}
	}
}

int LinkList::LL_get(int i) {
	if (i > len || i < 1) {
		return error;
	}
	ListNode*num = LL_index(i);
	if(num==NULL)
		return error;
	else	
		return num->data;
	
}

int LinkList::LL_insert(int i, int item) {
	if (i < 1 || i> len+1 )
		return error;
	ListNode*pI = new ListNode;
	if (!head->next&&i == 1) {
		head->next = pI;
		pI->data = item;
		pI->next = NULL;
		len++;
		return ok;
	}
	int j = 0;
	ListNode*pG = head;
	while (pG->next&&j < i - 1) {
		pG = pG->next;
		j++;
	}
	if (!pG || j > i - 1)
		return error;
	ListNode*pU = new ListNode;
	pU->next = pG->next;
	pG->next = pU;
	pU->data = item;
	len++;
	return ok;
}
int LinkList::LL_del(int i) {
	if (i > len||i<1)
		return error;
	ListNode*pI = new ListNode;
	int j = 0;
	ListNode*pG = head;
	while (pG->next&&j < i - 1) {
		pG = pG->next;
		j++;
	}
	if (!pG || j > i - 1)
		return error;
	pI = pG->next;
	pG->next = pI->next;
	delete pI;
	len--;
	return ok;
}

int main() {
	LinkList sa;
	int num;
	cin >> num;
	int number;
	for (int i = 0; i < num; i++) {
		cin >> number;
		sa.LL_insert(i + 1, number);
	}
	sa.LL_display();

	int i, item, k;

	cin >> i >> item;
	k = sa.LL_insert(i, item);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i >> item;
	k = sa.LL_insert(i, item);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i;
	k = sa.LL_del(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i;
	k = sa.LL_del(i);
	if (k == 0)
		sa.LL_display();
	else
		cout << "error" << endl;

	cin >> i;
	k = sa.LL_get(i);
	if (k == -1)
		cout << "error" << endl;
	else
		cout << k << endl;

	cin >> i;
	k = sa.LL_get(i);
	if (k == -1)
		cout << "error" << endl;
	else
		cout << k << endl;

	return 0;
}

好开心！不过这罚时也是没谁了

Phoenix0z
关注
专栏目录
数据结构面试题和题目解析
12-05
链表的主要优点是插入和删除操作比较方便，但访问链表中的元素不如访问数组中的元素效率高。2. 什么是二叉树？二叉树是一种非线性数据结构，由一系列节点组成，每个节点最多有两个子节点，称为左子节点和右子节点。...
5-1链队入队出队操作
m0_61630188的博客
05-16 918
链队基本操作。 #include<iostream> using namespace std; #define OK 1 #define ERROR 0 typedef int Status; typedef char QElemType; typedef struct QNode { QElemType data; struct QNode *next; } QNode, *QueuePtr; typedef struct { QueuePtr front;
顺序表相关操作实现
qq_31239371的博客
05-12 422
/*顺序表的相关定义及操作，重点掌握查找，插入以及删除操作及其时间复杂度*/ #include <stdio.h> #include <stdlib.h> #include <math.h> #include <iostream> using namespace std; #define TRUE 1 #define FALSE 0 #define OK 1 #define ERROR 0 #define INFEASIBLE -1 #define.
数据结构：单链表的概念和实现（附源码）
最新发布
Zyzzzyz_的博客
10-01 490
单链表概念概解及单链表个函数的代码实现
在顺序表中第五个位置插入一个元素9，实现顺序表插入的基本操作，输出顺序表中所有元素
Zhangguohao666的博客
12-15 6978
题目 在顺序表中第五个位置插入一个元素9，实现顺序表插入的基本操作，输出顺序表中所有元素 #include&lt;iostream&gt; using namespace std; #define OK 1 #define ERROR 0 #define OVERFLOW -2 typedef int Status; //Status 是函数返回值类型，其值是函数结果状态代码。 typedef ...
链表的插入，删除算法设计思考（保留不同变量对算法的设计会产生哪些影响，插入和删除节点的循环条件为什么这么复杂）
Tec Log
07-12 296
设计链表的实现。您可以选择使用单链表或双链表。单链表中的节点应该具有两个属性：val 和 next。val 是当前节点的值，next 是指向下一个节点的指针/引用。如果要使用双向链表，则还需要一个属性 prev 以指示链表中的上一个节点。假设链表中的所有节点都是 0-index 的。在链表类中实现这些功能：此题目通过单向链表即可解决，因此不考虑双向链表算法。链表冗余信息的选择作为一个链表，需要保存哪些冗余信息?head：肯定要有，最好还是用虚拟nodesize：肯定要有。如果没有保存size当使用while
顺序表的相关操作（查找、插入、删除、有序插入）
，，，，，，，，，的博客
06-04 8864
一、查找 本题要求实现一个函数，要求从顺序表中查找指定元素，并返回第一个查找成功的元素在表中的位置序号，若查找失败，则返回0； 函数接口定义： int LocateElem(SqList L,ElemType e); 其中SqList结构定义如下： typedef struct{ ElemType *elem; int length; }SqList; 裁判测试程序样例：...
数据结构和算法课程设计题目
06-19
- **查找和插入**: 实现散列表的基本操作。 ##### (二) 参考题目二 1. **运动会分数统计** - 存储结构设计: 可以使用多维数组来存储每个学校在不同项目中的得分。 - 排序算法: 使用快速排序、归并排序等算法对...
链表面试题_链表_面试题_cow3cm_数据结构_
09-30
链表是一种基础且重要的数据结构，在计算机科学特别是数据结构领域占据着核心地位。它由一系列节点（也称为元素或记录）组成，每个节点包含数据以及指向下一个节点的引用（在单链表中）或者同时包含向前和向后引用...
杭州电子科技大学数据结构(题目).pdf
04-26
1. **数据结构的定义**：数据结构可以被定义为一个三元组(D, S, P)，其中D表示数据对象，S表示这些数据对象之间的关系，P则是对这些数据执行的基本操作集合。这个定义准确概括了数据结构的核心要素。 2. **数据...
数据结构高分5套卷-试卷1（含详细解析）
08-07
此外，散列（哈希表）也是重要的数据结构，它提供了快速的查找、插入和删除操作，常用于实现关联数组和缓存。哈希冲突的解决方法，如开放寻址法和链地址法，也可能出现在试题中。 排序和查找是数据结构的基础应用，...
数据结构单链表的创建，插入，修改，查找以及删除
10-24
数据结构单链表的创建，插入，修改，查找以及删除。线性表操作
顺序表操作（初始化、取值、查找、删除、插入）17计科班
智慧源
03-21 7326
#include<iostream> using namespace std; #define MAXSIZE 100 #define OK 1 #define ERROR 0 #define OVERFLOW -2 typedef int ElemType; typedef int Status; typedef struct{ ElemType *elem; int le...
顺序表的插入、删除和查找操作
懵逼是一种状态的博客
05-08 9614
1）插入操作 在顺序表中第i个位置插入新元素e。如果i不合法，则返回false，表示插入失败；否则，将顺序表第i个位置上的元素以及其后的元素全部右移一个位置，腾出一个空位置插入新元素e，顺序表长增加1，插入成功，返回true。 bool ListInsert(&SqList L,int i;ElemType e) //传入顺序表名L,插入的位置i以及插入的数值e； { ...
数据结构专题(二):2.3链表插入元素，尾插法
weixin_43907175的博客
12-28 1000
因为结构内存的差异，所以有头插法和尾插法两种形式。 本章博客主要讲解头插法 操作流程如下图 如下代码： ///插入元素，在指定的位置插入给定的值 //因为链表这种结构的内存是由程序员管理的，因此他的建立有一定的运算方法 //尾插法建立单链表（将逻辑上的顺序表放入单链表的物理结构当中） /* 顺序表：12，33，44，76，89，90（逻辑上的顺序表）=>单链表 本例中我们用数组表示这种顺序表 */ //arr:传入的顺序表，length：顺序表的长度 LinkListNode *create_Re.
4.链表（三）—插入，删除
quinn1994的博客
03-14 239
1）插入先大致理一下思路，完成插入，必须的先明确插入的值，然后再明确往链表的哪里插，也就是插入的位置。对了，还得明确往哪个链表里插。这样就需要三个参数，val,pos,pHead示例代码如下：bool insert_list(PNODE pHead,int pos,int val) { int i = 0; PNODE p = pHead; while(NULL != p&amp;&...
链表的插入与删除
yyyy11665的博客
08-14 6699
.实现链表的三种删除方法：头删法，尾删法，中间删除法。1.实现链表的三种插入方法：头插法，尾插法，中间插入。*同时为了验证结果实现了链表的显示。
链表实现插入与删除操作
ym18861512953的博客
04-07 524
链表实现插入与删除操作 【问题描述】 编写链表实现插入和删除等操作【输入形式】 【输出形式】 【样例输入输出】 请输入学生姓名： zhang wang li zhao sun qian 学生信息为： 2018001 li 2018002 wang 2018003 zhang 2018004 zhao 2018005 sun 2018006 qian 请输入要删除的学生学号： 2018004 学生信息为： 2018001 li 2018002 wang 2018003 zhang 2018005 sun 20
实验1 链表的插入和删除
qq_41719745的博客
11-24 828
一、【实验目的】 1、 了解单链表、循环链表和双链表的基本知识； 2、 掌握算法思想和数据结构的描述； 3、 掌握链表的插入、删除的相关语句及基本方法。 二、【实验内容】 设有两个无头结点的单链表，分别为ha，hb，其链中有数据域data，链域next，两链表的数据都按递增序存放。现要求将hb表归到ha表中，且归并后ha仍按递增排序，归并中ha表中已有的数据若与hb相同，则hb中的数据不归并到ha中，hb的链表在算法中不允许破坏。 三、【实验步骤与要求】 1、 实验前的准备 （1） 了解C语言的基本概念；
广工数据结构考试题目解析：顺序表与链表操作
插入和删除操作的时间复杂度通常较高，分别为O(n)和O(n)，除非通过特定的数据结构优化（如动态数组的双端队列或红黑树，但题目没有提及）。 2. **链表存储方式**： - 在链表中，仅有一个头指针的单链表和单循环...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值