C/C++ 语言练习之手撕双链表

//双链表类定义
//双链表节点
struct DoubleListNode
{
    int data;
    DoubleListNode* prev;
    DoubleListNode* next;
    DoubleListNode(int val);
};

//双链表
class DoubleList
{
public:
    DoubleListNode* dummy;
public:
    DoubleList();
    ~DoubleList();
public:
    void add(int);
    void remove(int);
    DoubleListNode* find(int);
};


#include<iostream>
#include "DoubleList.h"

DoubleListNode::DoubleListNode(int val):data(val),prev(nullptr),next(nullptr){}  //初始化头节点
DoubleList::DoubleList():dummy(new DoubleListNode(-1)){
    dummy->prev  = nullptr;
    dummy->next = nullptr;
}

DoubleList::~DoubleList(){
    auto ptr = dummy->next;
    while (ptr)
    {
        auto temp = ptr;
        ptr = ptr->next;
        delete temp;
        std::cout<<"Element Deleted!"<<std::endl;

    }
    delete dummy;
    std::cout<<"DoubleList destoryed!"<<std::endl;
}

void DoubleList::add(int val){
    auto ptr = find(val);
    if(ptr){
        std::cerr << val <<"exists, add failed!" <<std::endl;
    }else{
        auto temp = new DoubleListNode(val);
        temp->next = dummy->next;
        temp->prev = dummy;
        if(dummy->next){
            dummy->next->prev = temp;
        }
        dummy->next = temp;
    }
}

void DoubleList::remove(int val){
    auto ptr  = find(val);
    if(ptr == nullptr){
        std::cerr<<val<<"does not exist, remove failed!. "<<std::endl;
    }else{
        if(ptr->next){
            ptr->next->prev = ptr->prev;
        }
        ptr->prev->next = ptr->next;
        delete ptr;
    }
}

DoubleListNode* DoubleList::find(int val){
    auto temp = dummy->next;
    while(temp){
        if(temp->data == val){
            return temp;
        }
        temp = temp->next;
    }
    return nullptr;
}

int main(void) {
	DoubleList list;

	list.add(0);
	list.add(1);
	list.add(2);
	list.add(3);
	list.add(4);
	list.add(4);	// 添加已存在元素
	list.remove(0); // 末尾元素
	list.remove(2); // 中间元素
	list.remove(4); // 开头元素
	list.remove(4); // 删除不存在元素
	for (auto temp = list.dummy->next; temp; temp = temp->next)
		std::cout << temp->data << " ";
	std::cout << std::endl;
	return 0;
}

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值