public class MaxHeap<T extends Comparable<? super T>> {
	private T[] data;
	private int size;
	private int capacity;
	public MaxHeap(int capacity) {
		this.data = (T[]) new Comparable[capacity + 1];
		size = 0;
		this.capacity = capacity;
	}
	public int size() {
		return this.size;
	}
	public Boolean isEmpty() {
		return size == 0;
	}
	public int getCapacity() {
		return this.capacity;
	}
	/**
   * @return 查看最大根(只看不刪, 與popMax對比)
   */
	public T seekMax() {
		return data[1];
	}
	public void swap(int i, int j) {
		if (i != j) {
			T temp = data[i];
			data[i] = data[j];
			data[j] = temp;
		}
	}
	public void insert(T item) {
		size++;
		data[size] = item;
		shiftUp(size);
	}
	/**
   * @return 彈出最大根(彈出意味著刪除, 與seekMax對比)
   */
	public T popMax() {
		swap(1, size--);
		shiftDown(1);
		return data[size + 1];
	}
	/**
   * @param child 孩子節(jié)點下角標是child，父節(jié)點下角表是child/2
   */
	public void shiftUp(int child) {
		while (child > 1 && data[child].compareTo(data[child / 2]) > 0) {
			swap(child, child / 2);
			child = child / 2;
		}
	}
	/**
   * @param a data數(shù)組中某個元素的下角標
   * @param b data數(shù)組中某個元素的下角標
   * @return 哪個元素大就返回哪個的下角標
   */
	private int max(int a, int b) {
		if (data[a].compareTo(data[b]) < 0) {
			//如果data[b]大
			return b;
			//返回b
		} else {
			//如果data[a]大
			return a;
			//返回a
		}
	}
	/**
   * @param a data數(shù)組中某個元素的下角標
   * @param b data數(shù)組中某個元素的下角標
   * @param c data數(shù)組中某個元素的下角標
   * @return 哪個元素大就返回哪個的下角標
   */
	private int max(int a, int b, int c) {
		int biggest = max(a, b);
		biggest = max(biggest, c);
		return biggest;
	}
	/**
   * @param father 父節(jié)點下角標是father,左右兩個孩子節(jié)點的下角表分別是：father*2 和 father*2+1
   */
	public void shiftDown(int father) {
		while (true) {
			int lchild = father * 2;
			//左孩子
			int rchild = father * 2 + 1;
			//右孩子
			int newFather = father;
			//newFather即將更新，父、左、右三個結(jié)點誰大，newFather就是誰的下角標
			if (lchild > size) {
				//如果該father結(jié)點既沒有左孩子，也沒有右孩子
				return;
			} else if (rchild > size) {
				//如果該father結(jié)點只有左孩子，沒有右孩子
				newFather = max(father, lchild);
			} else {
				//如果該father結(jié)點既有左孩子，又有右孩子
				newFather = max(father, lchild, rchild);
			}
			if (newFather == father) {
				//說明father比兩個子結(jié)點都要大，表名已經(jīng)是大根堆，不用繼續(xù)調(diào)整了
				return;
			} else {
				//否則，還需要繼續(xù)調(diào)整堆，直到滿足大根堆條件為止
				swap(father, newFather);
				//值進行交換
				father = newFather;
				//更新father的值，相當于繼續(xù)調(diào)整shiftDown(newFather)
			}
		}
	}
	public static void main(String[] args) {
		//創(chuàng)建大根堆
		MaxHeap<Integer> maxHeap = new MaxHeap<Integer>(100);
		//向堆里存
		for (int i = 0; i < 100; i++) {
			maxHeap.insert((int) (Math.random() * 100));
		}
		//創(chuàng)建數(shù)組
		Integer[] arr = new Integer[100];
		//從堆里取，放進數(shù)組里
		for (int i = 0; i < 100; i++) {
			arr[i] = maxHeap.popMax();
			System.out.print(arr[i] + " ");
		}
		System.out.println();
	}
}

public class MaxHeap<T extends Comparable<? super T>> {
	private T[] data;
	private int size;
	private int capacity;
	public MaxHeap(int capacity) {
		data = (T[]) new Comparable[capacity + 1];
		this.capacity = capacity;
		size = 0;
	}
	public int size() {
		return size;
	}
	public Boolean isEmpty() {
		return size == 0;
	}
	public void insert(T item) {
		data[size + 1] = item;
		size++;
		shiftUp(size);
	}
	/**
   * @return 彈出最大根(彈出意味著刪除, 與seekMax對比)
   */
	public T popMax() {
		T ret = data[1];
		swap(1, size);
		size--;
		shiftDown(1);
		return ret;
	}
	/**
   * @return 查看最大根(只看不刪, 與popMax對比)
   */
	public T seekMax() {
		return data[1];
	}
	public void swap(int i, int j) {
		if (i != j) {
			T temp = data[i];
			data[i] = data[j];
			data[j] = temp;
		}
	}
	public void shiftUp(int k) {
		while (k > 1 && data[k / 2].compareTo(data[k]) < 0) {
			swap(k, k / 2);
			k /= 2;
		}
	}
	public void shiftDown(int father) {
		while (2 * father <= size) {
			int newFather = 2 * father;
			if (newFather + 1 <= size && data[newFather + 1].compareTo(data[newFather]) > 0) {
				//data[j] data[j+1]兩者取大的那個
				newFather = newFather + 1;
			}
			if (data[father].compareTo(data[newFather]) >= 0) {
				break;
			} else {
				swap(father, newFather);
				//值進行交換
				father = newFather;
				//newFather是(2*father)或者是(2*father+1),也就是繼續(xù)shiftDown(newFather);
			}
		}
	}
	public static void main(String[] args) {
		//創(chuàng)建大根堆
		MaxHeap<Integer> maxHeap = new MaxHeap<Integer>(100);
		//向堆里存
		for (int i = 0; i < 100; i++) {
			maxHeap.insert((int) (Math.random() * 100));
		}
		//創(chuàng)建數(shù)組
		Integer[] arr = new Integer[100];
		//從堆里取，放進數(shù)組里
		for (int i = 0; i < 100; i++) {
			arr[i] = maxHeap.popMax();
			System.out.print(arr[i] + " ");
		}
		System.out.println();
	}
}