java 链表 深拷贝,链表深拷贝构造函数

I am implementing a linked list class' copy constructor which will make a deep copy. This is the code that i have:

List( const List & rhs ) {

Node* rhsFront = rhs.header->next;

Node* prev = header;

while (rhsFront) {

prev->next = new Node(rhsFront->data, nullptr);

rhsFront = rhsFront->next;

prev = prev->next;

}

}

However, it crashes at this line:

prev->next = new Node(rhsFront->data, nullptr);

What did I do wrong?

解决方案

Node* prev = header;

I would guess the header there not to be initialised, thus causing the prev->next to be a random pointer (most likely something like 0) and trying to write to that point crashes the program. If so, this might work.

List( const List & rhs ) {

Node* rhsFront = rhs.header->next;

header = new Node(rhs.header->data, nullptr);

Node* prev = header;

while (rhsFront) {

prev->next = new Node(rhsFront->data, nullptr);

rhsFront = rhsFront->next;

prev = prev->next;

}

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值