循环,双链表-分段错误
Circular, Doubly Linked List- Segmentation Fault
编辑:
好的,我已经解决并完成了我最初的所有问题。然而,现在,我在List.cpp的第54行gotoLast上遇到了一个分段错误,我似乎不明白为什么是分段错误。
List.h:
#ifndef _list_h
#define _list_h
struct ListNode
{
int data;
int rank;
ListNode *prev, *next;
// ListNode (int x = 0, ListNode *n, ListNode *p);
};
class List {
private:
ListNode *current;
ListNode *head;
ListNode *temp;
public:
List( );
int size( );
int currentValue( );
int currentRank( );
void gotoFirst( );
void gotoLast( );
void retreat( );
void advance( );
void gotoRank(int r);
bool isNull( );
bool isFirst( );
bool isLast( );
void insertFirst(int x);
void insertLast(int x);
void insertBefore(int x);
void insertAfter(int x);
void replace(int x);
int removeFirst( );
int removeLast( );
int remove( );
int removeAndRetreat( );
int removeAndAdvance( );
void display( );
};
#endif
和我的列表.cpp:
#include <iostream>
using namespace std;
#include "List.h"
int ncounter = 0;
int rank = 0;
/*ListNode (int x = 0, ListNode *n, ListNode *p)
{
data = x;
next = n;
prev = p;
}
*/
List::List( )
{
//ListNode *head;
//ListNode *temp;
//ListNode *current;
head = NULL;
current = NULL;
temp = NULL;
return;
}
int List::size( )
{
return ncounter;
}
int List::currentValue( )
{
int v;
if( current == NULL)
{
return 0;
}
else
{
v = current -> data;
return v;
}
}
int List::currentRank( )
{
return rank;
}
void List::gotoFirst( )
{
current = head;
rank = 0;
}
void List::gotoLast( )
{
current = head -> prev;
rank = ncounter-1;
}
void List::retreat( )
{
current = current -> prev;
}
void List::advance( )
{
current = current -> next;
}
void List::gotoRank(int r)
{
current = head;
for ( int i=0; i != r; i++)
{
current = current -> next;
}
rank = r;
}
bool List::isNull( )
{
if ( current == NULL)
return true;
else
return false;
}
bool List::isFirst( )
{
if ( current == head)
{
return true;
}
else
{
return false;
}
}
bool List::isLast( )
{
if ( current == head -> prev)
{
return true;
}
else
{
return false;
}
}
void List::insertFirst(int x)
{
if ( head == NULL)
{
head = new ListNode;
head -> data = x;
head -> next = head;
head -> prev = head;
ncounter++;
rank = 0;
}
else
{
ListNode *temp = new ListNode;
temp -> data = x;
temp -> next = head;
temp -> prev = head -> prev;
head -> prev -> next= temp;
head -> prev = temp;
head = temp;
rank++;
ncounter++;
}
}
void List::insertLast(int x)
{
if (head == NULL)
{
head = new ListNode;
head -> data = x;
head -> next = head;
head -> prev = head;
}
else
{
ListNode *temp = new ListNode;
temp -> data = x;
temp -> next = head;
temp -> prev = head -> prev;
head -> prev -> next = temp;
head -> prev = temp;
ncounter++;
}
}
void List::insertBefore(int x)
{
ListNode *temp = new ListNode;
temp -> data = x;
temp -> next = current;
temp -> prev = current -> prev;
current -> prev -> next = temp;
current -> prev = temp;
rank++;
ncounter++;
}
void List::insertAfter(int x)
{
ListNode *temp = new ListNode;
temp -> data = x;
temp -> next = current -> next;
current -> next -> prev = temp;
current ->next = temp;
temp -> prev = current;
ncounter++;
}
void List::replace(int x)
{
current -> data = x;
}
int List::removeFirst( )
{
int tempx;
if( current == head)
{
current = NULL;
}
if(head->next == head)
{ tempx = head ->data;
head = NULL;
return tempx;
}
else
{
ListNode *temp = head;
tempx = temp -> data;
head = head ->next;
temp -> prev -> next = head;
head -> prev = temp -> prev;
delete temp;
ncounter--;
rank--;
return tempx;
}
}
int List::removeLast( )
{
int tempx;
if ( current == head -> prev)
{
current = NULL;
}
if(head->prev == head)
{ tempx = head ->data;
head = NULL;
return tempx;
}
else
{
ListNode *temp = head -> prev;
tempx = temp -> data;
temp -> prev -> next = head;
head -> prev = temp -> prev;
delete temp;
ncounter--;
return tempx;
}
}
int List::remove( )
{
int tempx;
if(head->next == head)
{
tempx = head -> data;
head = NULL;
return tempx;
}
else
{
ListNode *temp = current;
tempx = current -> data;
temp -> prev -> next = temp -> next;
temp -> next -> prev = temp -> prev;
current = NULL;
delete temp;
ncounter--;
rank=0;
return tempx;
}
}
int List::removeAndRetreat( )
{
ListNode *temp;
int tempx;
temp = current;
current -> prev -> next = current -> next;
current -> next -> prev = current -> prev;
tempx = current -> data;
current = current -> prev;
delete temp;
ncounter--;
rank--;
return tempx;
}
int List::removeAndAdvance( )
{
ListNode *temp;
int tempx;
temp = current;
current -> prev -> next = current -> next;
current -> next -> prev = current -> prev;
tempx = current -> data;
current = current -> next;
delete temp;
ncounter--;
return tempx;
}
void List::display( )
{
if(head == NULL )
cout <<"[ ]" << endl;
else
{
ListNode *temp = head;
cout << "[ ";
for ( int i = 0; i < ncounter; i++)
{
if (temp == current)
{
cout << "( " << current -> data << ") ";
}
else
{
cout << temp -> data << " ";
temp = temp -> next;
}
}
cout << " ]";
}
insertLast代码在CDDL中实际上要简单得多。您只需在第一个节点之前插入,因为这也是最后一个节点。
相关文章:
- 在某些循环内使用vector.push_back时出现分段错误
- 为什么在运行时没有向我们提供有关分段错误的更多信息?
- 如何解决gcc编译器优化导致的centos双编译器设置中的分段错误
- 当我的阵列太大时出现分段错误
- 分段错误当我试图运行程序时出错
- 在c++中初始化矩阵时出现分段错误(核心转储)
- 尝试使用集合函数时出现分段错误
- 我无法缩小此分段错误的原因
- g++的分段错误(在NaN上使用to_string两次时)
- 我是如何在这段代码中出现分段错误的
- 创建结构的数组时遇到分段错误
- 在c++中键入向量中的所有值后,得到分段错误(核心转储)
- 在 c++ 中实现 Trie 时出现分段错误
- 为什么 fstream 在打开带有格式的文件时会导致分段错误?
- 为什么我遇到分段错误?
- 动态类的分段错误(家庭作业问题)
- 分段错误 - 读取初始化指针的数组
- 如何摆脱C ++中的分段错误错误?
- 使用 CTYPE 时出现分段错误
- 为什么代码给出分段错误?