跳过列表节点 add() 失败

Question

我有这个代码用于我从在线源修改的跳过列表，add(x) 方法有点工作。

add(5);
add(4);
add(7);

当您添加一个像 5 这样的数字，然后添加任何小于最后一个数字的数字（如 4）时，它会起作用，但是一旦它达到 7 或任何大于前一个数字的数字，它就会陷入循环，我不明白为什么。

package assignment1;

public class Node {
    public static int item;
    public static Node[] next;
    public static int MAX_LEVEL = 6;
    public static int level;
    public static int n;
    public static Node head = new Node(MAX_LEVEL, 0);


    public Node(int level, int value){
        next = new Node[level + 1];
        this.item = value;
    }
    public static int randomLevel() {
        int lvl = (int)(Math.log(1. * -Math.random()) / Math.log(1. * -0.5));
        return Math.min(lvl, MAX_LEVEL);
    } 

    public static void add(int value){
        Node current = head;    
        Node[] update = new Node[MAX_LEVEL + 1];

        for (int i = level; i >= 0; i--) {
        while (current.next[i] != null && current.next[i].item - value < 0) {
            current = current.next[i];
        }
        update[i] = current; 
    }
    current = current.next[0];

        if (current == null || current.item != value) {        
        int lvl = randomLevel();

            if (lvl > level) {
                for (int i = level + 1; i <= lvl; i++) {
                update[i] = head;
        }
                level = lvl;
        }
            current = new Node(lvl, value);
        for (int i = 0; i <= lvl; i++) {
            current.next[i] = update[i].next[i];
            update[i].next[i] = current;
        }
            n++;
        }
    }

    public static void remove(int value){
        Node current = head;    
        Node[] update = new Node[MAX_LEVEL + 1];

        for (int i = level; i >= 0; i--) {
        while (current.next[i] != null && current.next[i].item - value < 0) {
            current = current.next[i];
            }
        update[i] = current; 
    }
    current = current.next[0];

        if (current.item == value) {
            for (int i = 0; i <= level; i++) {
            if (update[i].next[i] != current){
                break;
            }
            update[i].next[i] = current.next[i];
        }
            while (level > 0 && head.next[level] == null) {
            level--;
        }
            n--;
        }
    }

    public static void list(){
        Node current = head;
        System.out.print("[");
        for (int i = 0; i < n; i++){
            System.out.print(current.item + ",");
            current = current.next[0];
        }
        System.out.print("]");
    }


    public static void main(String[] args){
        add(10);
        add(9);
        add(8);
        add(7);
        add(6);
        add(5);
        add(4);
        add(3);
        add(2);
        add(1);
        list();
    }
}

编辑：我上传了我开发的整个代码，代码来自我的一本伪代码教科书，它需要被改编成 Java 格式。我不明白为什么它会失败。

Answer 1

我不知道你的实现出了什么问题，所以这里有一个可行的，你可以学习并且应该让你走上正确的道路：

import java.util.Random;
import java.util.Arrays;

public class SkipList
{
private class Node
{
    private int item;
    private Node[] next;

    public Node(int value, int level)
    {
        this.item = value;
        next = new SkipList.Node[level+1];
    }

    public int level()
    {
        return next.length-1;
    }
}

private  Node head;
private int size;

/**
 * Constructs a new, empty instance of SkipList.
 */
public SkipList()
{
    head = new Node(0, 0);
    size = 0;
}

private int randomLevel()
{
    int level;

    Random rand = new Random();

    for (level = 0; rand.nextInt() % 2 == 0; level++)
        ;

    return level;
}


public void add(int item)
{
    int maxLevel = head.level();

    Node current = head;

    Node[] nodePath = new SkipList.Node[maxLevel + 1];

    for (int level = maxLevel; level >= 0; level--)
    {
        while (current.next[level] != null && item > current.next[level].item)
        {
            current = current.next[level];
        }

        nodePath[level] = current;
    }

    current = current.next[0];

    if (current != null && item==(current.item))
    {
        return;
    } 
    else
    {
        int nodeLevel = randomLevel();

        if (nodeLevel > maxLevel)
        {
            head.next = Arrays.copyOf(head.next, nodeLevel + 1);

            nodePath = Arrays.copyOf(nodePath, nodeLevel + 1);

            for (int level = maxLevel + 1; level <= nodeLevel; level++)
            {
                nodePath[level] = head;
            }

            maxLevel = nodeLevel;
        }

        current = new Node(item, nodeLevel);

        for (int level = 0; level <= nodeLevel; level++) {
            current.next[level] = nodePath[level].next[level];

            nodePath[level].next[level] = current;
        }

        size++;
    }
}



public void list()
{
    Node current = head.next[0];
    System.out.print("[");
    while(current != null)
    {
        System.out.print(current.item + ",");
        current = current.next[0];
    }
    System.out.println("\b]");
}


public static void main(String[] args)
{
    SkipList theList= new SkipList();

    theList.add(10);
    theList.add(9);
    theList.add(8);
    theList.add(11);
    theList.add(6);
    theList.add(5);
    theList.add(7);
    theList.add(3);
    theList.add(4);
    theList.add(1);
    theList.add(2);
    theList.list();
}
}

输出：

[1,2,3,4,5,6,7,8,9,10,11]