堆 Java

import java.util.Random;

public class Heap {
	private static int maxsize = 100;
	private static int mindata = -(1 << 31);
	private int size;
	private int[] data_array;

	public Heap() {
		size = 0;
		data_array = new int[maxsize];
		data_array[0] = mindata;
	}

	public void Insert(int value) {
		try {
			if (maxsize == size)
				throw (new Exception());
		} catch (Exception e) {
			System.out.println("full size!");
		}
		size++;
		data_array[size]=value;
		int cindex = size;
		int pindex = cindex/2;
		while(1!=cindex)
		{
			if(data_array[pindex] > data_array[cindex])
				swap(cindex,pindex);
			else
				break;
			cindex /= 2;
			pindex /= 2;
		}
	}

	public int Delete() {
		try {
			if (IsEmpty())
				throw (new Exception());
		} catch (Exception e) {
			System.out.println("null data!");
		}
		int cindex = 1;
		int pindex = 2;
		int tmp = data_array[1];
		while(pindex<=size)
		{
			if(data_array[pindex+1]<data_array[pindex] && (pindex+1<=size))
				pindex++;
			data_array[cindex]=data_array[pindex];
			cindex = pindex;
			pindex *= 2;
		}
		size--;
		return tmp;
	}

	public void PrintHeap() {
		System.out.println("The Heap data is as follows");
		try {
			if (0 == size)
				throw (new Exception());
		} catch (Exception e) {
			System.out.println("null data!");
		}
		for (int i = 0; i < size; i++)
			System.out.print(data_array[i + 1]+"\t");
		System.out.println();
	}
	
	private final void swap (int i,int j)
	{
		try {
			if (!(i<=size && i>0) || !(j<=size && j>0))
				throw (new Exception());
		} catch (Exception e) {
			System.out.println("swap index error!");
		}
		int tmp = data_array[i];
		data_array[i] = data_array[j];
		data_array[j] = tmp;
	}
	private final boolean IsEmpty()
	{
		return (0==size);
	}
	
	public static void main(String [] args)
	{
		Heap myheap = new Heap();
		myheap.PrintHeap();
		Random r = new Random();
		for(int i= 0;i<10;i++)
		{
				myheap.Insert(r.nextInt(maxsize));
				myheap.PrintHeap();
		}
		System.out.println("The sorted data is : ");
		while(!myheap.IsEmpty())
		{
			System.out.print(myheap.Delete()+"\t");
		}
		System.out.println();
	}
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值