c++ 跳表详细讲解

_Yi_Xiao

已于 2022-07-09 10:42:08 修改

阅读量831

点赞数

CC 4.0 BY-SA版权

分类专栏： C/C++ 文章标签： c++ 数据结构链表

于 2022-07-09 10:41:23 首次发布

本文链接：https://blog.csdn.net/bo_peter/article/details/125687868

C/C++ 专栏收录该内容

11 篇文章

订阅专栏

跳表是一种基于链表的数据结构，通过增加多级索引提升查询效率，类似于BST但性能不那么稳定。常用于Redis等系统中。本文将详细介绍C++实现跳表的思路。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

c++ 跳表详细讲解

跳表建立在链表的基础之上，使用空间换时间，提高了链表的查询的效率。效果堪比BST，但是不够稳定，是redis的底层数据结构之一。

#pragma once

#pragma once

#include <vector>
#include <iostream>
#include <stdlib.h>

namespace yixiao{
    class SkipList
    {
    public:
        SkipList(size_t level = 4):level_(level)
        {
            head_ = new SkipNode(-1,level);
        }
        bool search(int key)
        {
            SkipNode* head = head_;
            for(int i = level_-1;i>=0;--i)
            {
                while(head->forward_[i]!= nullptr && head->forward_[i]->key_ < key)
                {
                    head = head->forward_[i];
                }
                if(head->forward_[i] != nullptr && head->forward_[i]->key_ == key)
                {
                    return true;
                }
            }
            return false;
        }
        bool add(int key)
        {
            if(search(key)) return false;
            size_t level = RandomLevel();
            SkipNode* node = new SkipNode(key,level);
            SkipNode* head = head_;
            for(int i = level_-1;i>=0;--i)
            {
                while(head->forward_[i]!= nullptr && head->forward_[i]->key_ < key)
                {
                    head = head->forward_[i];
                }
                if(level > i)
                {
                    node->forward_[i] = head->forward_[i];
                    head->forward_[i] = node;
                }
            }
            return true;
        }
        bool erase(int key)
        {
            SkipNode* head = head_;
            SkipNode* node = nullptr;
            for(int i = level_-1;i>=0;--i)
            {
                while(head->forward_[i]!= nullptr && head->forward_[i]->key_ < key)
                {
                    head = head->forward_[i];
                }
                if(head->forward_[i] != nullptr && head->forward_[i]->key_ == key)
                {
                    node = head->forward_[i];
                    head->forward_[i] = node->forward_[i];
                }
            }
            if(node == nullptr)
            {
                return false;
            }else
            {
                delete node;
                node = nullptr;
                return true;
            }
        }
        void printSkipList()
        {
            for(int i= level_-1;i>=0;--i)
            {
                SkipNode* head = head_;
                while (head->forward_[0]!=nullptr)
                {
                    if(head->forward_.size()>i)
                    {
                        std::cout<<head->forward_[0]->key_<<"\t";
                    }
                    else
                    {
                        std::cout<<"\t";
                    }
                    head = head->forward_[0];
                }
                std::cout<<std::endl;
            }
        }
    private:
        size_t RandomLevel()
        {
            size_t level = 1;
            while(rand() % 2)
            {
                level++;
            }
            return  level>level_?level_:level;
        }
        struct SkipNode
        {
            int key_;
            //val
            std::vector<SkipNode*> forward_;
            SkipNode(int key,size_t level):key_(key),forward_(level,nullptr){}
        };
        
        size_t level_;
        SkipNode* head_;
    };
}