跳表（Java 实现）

public abstract class SkipListUtil {
   
   

    /**
     * 按照规则生成随机层数，层数越大，概率越低
     *
     * @return
     */
    public static int generateRandomLevel() {
   
   
        int result = SkipListConfig.MIN_LEVEL;
        Random random = new Random();
        while (random.nextInt(SkipListConfig.MAX_LEVEL) < SkipListConfig.MAX_LEVEL * SkipListConfig.P && result < SkipListConfig.MAX_LEVEL) {
   
   
            result++;
        }
        return result;
    }

    /**
     * 计算跳跃表的平均高度
     *
     * @param skipList
     * @param <T>
     * @return
     */
    public static <T> double computeAvgLevel(SkipList<T> skipList) {
   
   
        double result = 0;
        for (SkipListNode<T> skipListNode : skipList) {
   
   
            result += skipListNode.getLevels().length;
        }
        return result / skipList.length;
    }
}

public abstract class SkipListConfig {
   
   
    /**
     * 每一层节点提升为上层节点的概率，概率越大，层数越高
     */
    public static final double P = 0.5;
    public static final int MAX_LEVEL = 64;
    public static final int MIN_LEVEL = 1;
}

/**
 * 跳表节点
 */
@Data
@Accessors(chain = true)
@EqualsAndHashCode
public class SkipListNode<T> implements Comparable<SkipListNode<T>> {
   
   
    /**
     * 存储数据
     */
    private T element;

    /**
     * 排序的分值，约定0为最小分数
     */
    private double score;

    /**
     * 后退指针（指向前一个节点）
     * <p>
     * 头结点指向null
     */
    private SkipListNode<T> prev;

    /**
     * 每个节点的数组长度不一样，随机生成一个层级
     * <p>
     * 例如，层级为8，代表该节点出现在8个层级上
     * <p>
     * 值越大，出现概率越低
     */
    private SkipListLevel<T>[] levels;

    @Override
    public int compareTo(SkipListNode<T> other) {
   
   
        return Double.compare(this.score, other.