优先队列-Java实现

Gee_Zer

于 2021-04-27 17:34:20 发布

阅读量250

点赞数

CC 4.0 BY-SA版权

分类专栏： Java 文章标签：二叉树数据结构树堆

本文链接：https://blog.csdn.net/Gee_Zer/article/details/116205962

Java 专栏收录该内容

25 篇文章

订阅专栏

这篇博客介绍了基于二叉堆实现的优先队列。Hoop类包含了添加元素(add)和删除元素(poll)的方法，以及内部的push和pop辅助方法，确保堆的性质。添加操作将元素添加到数组末尾并向上调整，删除操作则替换根节点并向下调整，保持堆的有序性。

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

   class Hoop {
        int tree[];
        int size;

        public Hoop(int capacity) {
            this.tree = new int[capacity + 1];
            this.size = 1;
        }

        public void add(int val){
            if (size == tree.length + 1) {
                return;
            }
            tree[size] = val;
            push(size);
            size++;
        }

        public int poll() {
            if (size < 1) {
                size = 1;
                return -1;
            }

            int t = tree[1];
            tree[1] = tree[size - 1];
            size--;
            pop(1);
            return t;
        }

        private void push(int index) {
            if (index == 1){
                return;
            }
            int father = index / 2;
            if (tree[index] < tree[father]) {
                int t = tree[index];
                tree[index] = tree[father];
                tree[father] = t;
                push(father);
            }
        }

        private void pop(int idx) {
            if (idx >= tree.length) {
                return;
            }
            int left = 2 * idx;
            int right = 2 * idx + 1;
            int leftVal = left >= size ? Integer.MAX_VALUE : tree[left];
            int rightVal = right >= size ? Integer.MAX_VALUE : tree[right];
            int min = Math.min(tree[idx], Math.min(leftVal, rightVal));
            if (min == tree[idx]) {
                return;
            } else if (min == leftVal) {
                int t = tree[idx];
                tree[idx] = tree[left];
                tree[left] = t;
                pop(left);
            } else {
                int t = tree[idx];
                tree[idx] = tree[right];
                tree[right] = t;
                pop(right);
            }
        }

        public boolean isEmpty() {
            return size == 1;
        }
    }