Java实现堆(最大堆，最小堆)

最新推荐文章于 2025-07-26 18:59:27 发布

原创最新推荐文章于 2025-07-26 18:59:27 发布 · 1k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#c语言 #链表 #开发语言

[数据结构-严蔚敏版] 同时被 2 个专栏收录

54 篇文章

订阅专栏

Java数据结构

12 篇文章

订阅专栏

这篇博客展示了如何实现最大堆和最小堆的数据结构，并提供了对应的插入和删除操作。测试类对这两个堆进行了实例操作，包括构建堆、插入元素以及删除最大/最小元素。

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

最大堆代码如下:

package MaxHeap;

import java.util.Scanner;

public class Heap {
    private int data[];
    private int size;
    private int capacity;
    private final int maxNum = 999999999;

    public Heap()
    {
        data = new int[10+1];
        size = 0;
        capacity= 10;
        data[0] = maxNum;
    }

    public Heap(int n)
    {
        data = new int[n+1];
        size = 0;
        capacity = n;
        data[0] = maxNum;
    }

    public boolean isFull()
    {
        return size==capacity;
    }

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

    public boolean insertHeap(int e)
    {
        if (isFull())
        {
            System.out.println("The heap is full");
            return false;
        }

        int i = ++size;
        for (;data[i/2] < e;i = i/2 )
        {
            data[i] = data[i/2];
        }
        data[i] = e;
        return true;
    }

    public int deleteMax()
    {
        if (isEmpty())
        {
            System.out.println("The heap is empty");
            return -1;
        }
        int maxData = data[1];
        int x = data[size--];
        int parent,child;
        for (parent = 1;parent * 2<=size;parent = child)
        {
            child = parent*2;
            if (child!=size && data[child] < data[child+1])
            {
                child++;
            }
            if (x >= data[child]) break;
            else data[parent] = data[child];
        }

        data[parent] = x;

        return maxData;
    }

    public void percDown(int p)
    {
        int parent,child;
        int x = data[p];
        for (parent = p;parent*2<=size;parent = child)
        {
            child = 2*parent;
            if (child !=size && data[child] <data[child+1])
            {
                child++;
            }
            if (x >= data[child]) break;
            else data[parent] = data[child];
        }
        data[parent] = x;

    }

    public void buildHeap(int n)
    {
        Scanner sc = new Scanner(System.in);
        for (int i = 1;i<=n;i++)
        {
            data[i] = sc.nextInt();
            size++;
        }
        for (int i = size/2;i>0;i--)
        {
            percDown(i);
        }
    }




}

测试类如下:

package MaxHeap;

public class TestHeap {
    public static void main(String[] args)
    {
        Heap h = new Heap(10);
        h.buildHeap(5);
        h.insertHeap(9999);
        System.out.println(h.deleteMax());
        System.out.println(h.deleteMax());

    }
}

最小堆代码如下:

package MinHeap;

import java.util.Scanner;

public class Heap {
    private int data[];
    private int size;
    private int capacity;
    private final int minNum = -999999999;

    public Heap()
    {
        data = new int[10+1];
        size = 0;
        capacity = 10;
        data[0] = minNum;
    }


    public Heap(int n)
    {
        data = new int[n+1];
        size = 0;
        capacity = n;
        data[0] = minNum;
    }

    public boolean isFull()
    {
        return size==capacity;
    }


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

    public boolean insertHeap(int e)
    {
        if (isFull())
        {
            System.out.println("The heap is full");
            return false;
        }

        int i = ++size;
        for (;data[i/2] > e;i = i/2)
        {
            data[i] = data[i/2];
        }
        data[i] = e;
        return true;
    }

    public int deleteMin()
    {
        if (isEmpty())
        {
            System.out.println("The heap is empty");
            return -1;
        }
        int parent,child;
        int minData = data[1];
        int x = data[size--];
        for (parent = 1;parent*2 <= size;parent = child)
        {
            child = parent*2;
            if (child !=size && data[child] > data[child+1])
            {
                child++;
            }
            if (x <= data[child]) break;
            else data[parent] = data[child];
        }
        data[parent] = x;
        return minData;
    }


    public void percDown(int p)
    {
        int parent,child;
        int x = data[p];
        for (parent = p;parent*2<=size;parent = child)
        {
            child = 2*parent;
            if (child !=size && data[child] > data[child+1])
            {
                child++;
            }
            if (x <= data[child]) break;
            else data[parent] = data[child];
        }
        data[parent] = x;
    }

    public void bulidHeap(int n)
    {
        Scanner sc = new Scanner(System.in);
        for (int i = 1;i<=n;i++)
        {
            data[i] = sc.nextInt();
            size++;
        }

        for (int i = size/2;i>0;i--)
        {
            percDown(i);
        }
    }

}

测试类如下:

package MinHeap;

public class TestHeap {
    public static void main(String[] args)
    {
        Heap h = new Heap();
        h.bulidHeap(5);
        h.insertHeap(-8);
        System.out.println(h.deleteMin());
        System.out.println(h.deleteMin());
    }
}