VS2013 链表插入操作 无法读取内存

amber_H amber_H 墨衍会员 · AI 创作全网分发 墨衍智能分发 通过墨衍一键同步至各平台 可同步平台 CSDN微信公众号微博知乎掘金百家号博客园抖音小红书 你的文章也可以这样分发 墨衍会员 ¥399起/年,写一次发全网 我也要 + 加入社区
工程中共有三个文件
List.h 文件

class Node{
public:
char data;
Node *pred;
Node *succ;

Node(){}
Node(char const& e, Node *p=NULL, Node *q=NULL){ data = e; pred = p; succ = q; }
~Node(){}
};

class List{
public:
Node *header;
Node *trailer;

int _size;

List();
~List(){}

int size()const;

Node * insertAsPred(int n, char const& letter);

char remove(int n);

void traverse()const;

};

List.cpp 文件

#include"List.h"
#include<stdio.h>

List::List(){
Node *header = new Node;
Node *trailer = new Node;

header->succ = trailer;
header->pred = NULL;
trailer->pred = header;
trailer->succ = NULL;

_size = 0;
}

int List::size()const{
return _size;
}

Node * List::insertAsPred(int n, char const& letter){
Node *flag;
flag = header->succ;
int times = n;
while (0<times){
flag = flag->succ;
times--;
}
Node* newNode = new Node(letter, flag->pred, flag);
flag->pred->succ = newNode;
flag->pred = newNode;
_size++;

return newNode;
}


char List::remove(int n){
Node *flag;
flag = header->succ;
int times = n;
while (0<times){
flag = flag->succ;
times--;
}
flag->pred->succ = flag->succ;
flag->succ->pred = flag->pred;
char dataTemp = flag->data;
delete flag;
return dataTemp;
}

void List::traverse()const{
Node* newNode = header->succ;
while (newNode!=trailer){
printf("%c ", newNode->data);
}
}

main.cpp 文件
#include"List.h"
#include<stdio.h>

int main(){
List *testList = new List();
testList->insertAsPred(0, 'A');
return 0;
}

程序运行到"flag = header->succ;"中止,
变量信息如下


恳请指教!拜托各位了。
...全文

相关推荐

评论 8
收藏 已收藏
分享
返回顶部
amber_H
新手乐园 33,314 成员 41,769 内容