Skip List跳跃表代码实现

Skip List相关知识介绍：http://blog.nosqlfan.com/html/3041.html

   http://www.cnblogs.com/xuqiang/archive/2011/05/22/2053516.html

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <ctime>
using namespace std;

#define MAX_LEVEL 20

struct Node{
    int key;
    int value;
    Node *forward[1];
};
struct skiplist{
    int level;
    Node *header;
};

int randomLevel()
{
    int k=0;
    while (rand()%2) k++;
    k = k < MAX_LEVEL ? k : MAX_LEVEL;
    return k;
}

void printSL(skiplist *sl)
{
    Node *p,*q;
    int k=sl->level;
    for(int i=k; i >= 0; i--)
    {
        p = sl->header->forward[i];
        printf("level[%d]: ",i);
        while(p->forward[i] != NULL)
        {
            printf("%d -> ",p->value);
            p = p->forward[i];
        }
        printf("%d\n",p->value);
    }
    printf("\n");
}

Node* create(int level,int key,int value){
    Node *node = (Node*)malloc(sizeof(Node) + level * sizeof(Node*));
    node->key = key;
    node->value = value;
    return node;
}

skiplist* createSkipList(){
    skiplist *sl = (skiplist*)malloc(sizeof(skiplist));
    sl->level = 0;
    sl->header = create(MAX_LEVEL,0,0);
    for(int i = 0 ; i <= MAX_LEVEL ; i ++){
        /* 注意此处虽然数组越界，但是由于申请的连续内存则无碍 */
        sl->header->forward[i]= NULL;
    }
    return sl;
}

bool insert(skiplist* sl,int key,int value){
    Node *update[MAX_LEVEL];
    Node *p,*q;
    p = sl->header;
    int k = sl->level;
    for(int i = k ; i >=0 ; i --){
        while(p->forward[i] != NULL && (p->forward[i]->key < key)){
            p = p->forward[i];
        }
        update[i] = p;
    }
    q = p->forward[0];
    if(q && q->key == key){
        return false;
    }

    k = randomLevel();
    printf("NewLevel: %d, CurLevel: %d\n",k,sl->level);
    if(k > sl->level){
        for(int i = sl->level + 1 ; i <= k ; i ++)
            update[i] = sl->header;
        sl->level = k;
    }

    q = create(k,key,value);
    for(int i = 0 ; i <= k ; i ++){
        q->forward[i] = update[i]->forward[i];
        update[i]->forward[i] = q;
    }
    printSL(sl);
    return true;
}

bool remove(skiplist *sl,int key){
    Node *update[MAX_LEVEL];
    Node *p,*q;
    p = sl->header;
    int k = sl->level;
    for(int i = k ; i >=0 ; i --){
        while(p->forward[i] != NULL && (p->forward[i]->key < key)){
            p = p->forward[i];
        }
        update[i] = p;
    }
    q = p->forward[0];
    if(q && q->key == key){
        for(int i = 0 ; i <= sl->level; i ++){
            if(update[i]->forward[i] != q)
                break;
            update[i]->forward[i] = q->forward[i];
        }
        free(q);
        for(int i = sl->level ; i > 0 ; i --){
            if(sl->header->forward[i] == NULL){
                sl->level --;
            }
        }
        return true;
    }
    else{
        return false;
    }
}

int search(skiplist *sl,int key){
    Node *p,*q;
    p = sl->header;
    int k = sl->level;
    for(int i = k ; i >= 0 ; i --){
        while((q = p->forward[i]) && q->key <= key){
            if(q->key == key)
                return q->value;
            p = q;
        }
    }
    return NULL;
}

int main(){
    srand((int)time(0));
    skiplist *sl=createSkipList();
    for(int i=1;i<=16;i++)
    {
        bool a = insert(sl,i,i*3);
    }
    int i=search(sl,10);
    printf("i=%d\n",i);
    bool b=remove(sl,6);
    return 0;
}

空间复杂度期望值O（n）

查询、插入、删除时间复杂度期望值O（logn）