我正在研究从链表中删除节点的迭代删除函数,我认为代码应该可以正常工作,它遍历列表,找到所需的节点,将头指向下一个节点并删除当前节点,但是当我测试运行它时,我得到了无限循环,请你帮我查明错误,这里是函数:
typedef struct E_Type * List;
struct E_Type
{
int data;
struct E_Type* next;
};
功能:
bool erase(List & l, int data){
List head = l;
if (l != 0){
for(List current = head; current; current = current->next){
if ( current->data == data )
head = current->next;
delete current;
return true;
}
}
return false;
}
测试程序:
int main()
{
List l = 0;
cout << boolalpha << l->data << "went well? "<< (insert(l,73)) << endl;
cout << boolalpha << l->data << "went well? "<< (insert(l,24)) << endl;
print(cout,l);
cout << boolalpha << "Is deleted 24? "<<(erase(l,24)) << endl;
cout << boolalpha << "Is deleted 35? "<<(erase(l,35)) << endl;
print(cout,l);
cout << endl;
return 0;
}
插入:
bool insert(List & l, int data)
{
List current = l;
while(current != 0) {
if (current->data == data)
return false;
current = current->next;
}
if (l == 0 || l->data > data){
List new_list = new E_Type;
new_list->data = data;
new_list->next = l;
l = new_list;
return true;
}
else if(l->data < data){
insert(l->next, data);
return true;
}
}