C++ (C+;+;)处理链表时,进程返回-1073741819(0xC0000005),但算法有效
此程序的目标是从列表中删除大于以下元素的任何元素。我已经设法让这个程序执行这个任务,但是它在执行此操作后立即崩溃,并且随后不打印列表,输出一个0xC0000005错误代码C++ (C+;+;)处理链表时,进程返回-1073741819(0xC0000005),但算法有效,c++,list,C++,List,此程序的目标是从列表中删除大于以下元素的任何元素。我已经设法让这个程序执行这个任务,但是它在执行此操作后立即崩溃,并且随后不打印列表,输出一个0xC0000005错误代码 #include <iostream> using namespace std; class List{ struct node{ int data; node* next; }; typedef struct node* nodePtr; nodeP
#include <iostream>
using namespace std;
class List{
struct node{
int data;
node* next;
};
typedef struct node* nodePtr;
nodePtr head;
nodePtr curr;
nodePtr temp;
public:
List()
{
head=NULL;
curr=NULL;
temp=NULL;
}
void AddNode(int addData)
{
nodePtr n = new node;
n->next = NULL;
n->data = addData;
if(head != NULL) {
curr = head;
while(curr->next != NULL) {
curr = curr->next;
}
curr->next = n;
}
else
{
head = n;
}
};
void DeleteNode(int delData)
{
nodePtr delPtr = NULL;
temp = head;
curr = head;
while(curr != NULL && curr->data != delData) {
temp = curr;
curr = curr->next;
}
if(curr == NULL) {
cout << delData << " is not in the list" << endl;
delete delPtr;
}
else {
delPtr = curr;
curr = curr->next;
temp->next = curr;
if(delPtr == head) {
head = head->next;
temp = NULL;
}
delete delPtr;
cout << delData << " was removed from the list" << endl;
}
};
void PrintList()
{ cout << "List: " << endl;
curr = head;
while (curr != NULL) {
cout << curr->data << endl;
curr = curr->next;
}
}
void toss()
{
curr = head;
while (curr != NULL) {
if(curr->data>curr->next->data){
DeleteNode(curr->data);
curr = head;
}
else curr = curr->next;
if(curr == NULL) break;
}
}
};
int main() {
List list;
int i;
cout << "Input list values, stop input by inputting 0: " << endl;
cin >> i;
while(i != 0){
list.AddNode(i);
cin >> i; // 18 9 3 4 0
}
list.PrintList(); // 18 9 3 4
list.toss(); // tosses 18 and 9
list.PrintList(); // should output 3 4
};
如果您对此问题有任何意见或帮助,我们将不胜感激,谢谢 当它到达列表中的最后一个节点时,aka
curr->next
等于null,您试图访问curr->next->data
,但next为null。将if语句更改为:
while (curr != NULL) {
if(curr->next != NULL && curr->data > curr->next->data){
DeleteNode(curr->data);
curr = head;
}
else curr = curr->next;
if(curr == NULL) break;
}
或者类似的东西。您还可以在while循环的条件中检查这一点
所以基本上,在访问布局良好的问题之前,您必须确保
curr->next
不为空。让我们看看我们能做些什么来帮助。如果(curr->data>curr->next->data)
可疑curr
已经过测试,并且被认为是良好的,但是未选中curr->next
。列表中的最后一项将爆炸,因为没有next
无关:if(curr==NULL)中断代码>是多余的。循环条件可以为您执行此操作。@user4581301我将其更改为while(curr!=NULL&&curr->next!=NULL),现在它似乎可以工作了,非常感谢!!无关:用于简化DeleteNode
while (curr != NULL) {
if(curr->next != NULL && curr->data > curr->next->data){
DeleteNode(curr->data);
curr = head;
}
else curr = curr->next;
if(curr == NULL) break;
}