【我自己写的LinkedList为什么总有错?】# JobHunting - 待字闺中
h*g
1 楼
执行的时候总说segmentation fault,
谢谢大家指点
===================================
#include
using namespace std;
template< class T>
class ListNode{
public:
T data;
ListNode(T v);
ListNode< T > *next;
};
template ListNode < T >::ListNode(T v)
{
}
template
class LinkedList{
ListNode *head;
public:
LinkedList(){}
~LinkedList(){
while(head){
ListNode* next = head->next;
delete head;
head = next;
}
}
void Add (T v){
ListNode *n = new ListNode(v);
head->next= n;
}
void Delete(T v){
ListNode *current= head;
//ListNode *next_node;
while (current!=NULL){
if((current->next)->data == v){
// next_node = current->next
current = current->next->next;
}
else
current = current->next;
}
}
};
int main(){
LinkedList hehe;
// hehe.Add(10);
// hehe.Add(20);
}
谢谢大家指点
===================================
#include
using namespace std;
template< class T>
class ListNode{
public:
T data;
ListNode(T v);
ListNode< T > *next;
};
template
{
}
template
class LinkedList{
ListNode
public:
LinkedList(){}
~LinkedList(){
while(head){
ListNode
delete head;
head = next;
}
}
void Add (T v){
ListNode
head->next= n;
}
void Delete(T v){
ListNode
//ListNode
while (current!=NULL){
if((current->next)->data == v){
// next_node = current->next
current = current->next->next;
}
else
current = current->next;
}
}
};
int main(){
LinkedList
// hehe.Add(10);
// hehe.Add(20);
}
