2021-08-27

堆排序，开袋即食

import java.util.ArrayList;
import java.util.Comparator;

/**
 * @author wzy
 * @create 2021/8/27--15:23
 */
public class MyHeap<T> {
    ArrayList<T> array;
    Comparator<T> comp;

    MyHeap(Comparator<T> c) {
        array = new ArrayList<>();
        comp = c;
    }
    // 堆的构建过程就是依次插入过程
    void insert(T element) {
        int index = array.size();
        array.add(element);
        for (; index > 0 && comp.compare(array.get((index - 1) / 2), element) > 0; index = (index - 1) / 2) {
            array.set(index, array.get((index - 1) / 2));
        }
        array.set(index, element);
    }
    // 从堆中依次移除堆顶，依次移除的元素构成了堆排序的过程
    T remove() {
        T result = null;
        if (array.size() >= 1) {
            result = array.get(0);
            T newTop = array.get(array.size() - 1);  // 新的堆顶值
            array.remove(array.size() - 1);    // 相当于新旧堆顶值交换，删除了旧的堆顶值
            if(array.size()>0){
                int index = 0;
                while ((index << 1)+1 < array.size()) { // 左子树存在
                    int j = (index << 1) +1;
                    // 比较左右孩子，指向逻辑最小值
                    if (j + 1 < array.size() && comp.compare(array.get(j), array.get(j + 1)) > 0) {
                        j++;
                    }
                    // 新堆顶 大于 最小子孩子，交换
                    if (comp.compare(newTop, array.get(j)) > 0) {
                        array.set(index, array.get(j));
                    } else {
                        // 不大于，那么自己就是该子堆的最小
                        break;
                    }
                    index = j;
                }
                // 设置该子堆的堆顶
                array.set(index, newTop);
            }
        }
        return result;
    }

    public static void main(String[] args) {
        MyHeap<Integer> heap = new MyHeap<>(Comparator.comparingInt(a -> a));
        heap.insert(6);
        heap.insert(5);
        heap.insert(9);
        heap.insert(11);
        heap.insert(14);
        heap.insert(10);
        heap.insert(15);
        heap.insert(20);
        heap.insert(31);
        heap.insert(27);
        heap.insert(19);
        System.out.println(heap.array.toString());
        System.out.println("remove " + heap.remove());
        System.out.println(heap.array.toString());
        System.out.println("remove " + heap.remove());
        System.out.println(heap.array.toString());
        System.out.println("remove " + heap.remove());
        System.out.println(heap.array.toString());
        System.out.println("remove " + heap.remove());
        System.out.println(heap.array.toString());
        System.out.println("remove " + heap.remove());
        System.out.println(heap.array.toString());
        System.out.println("remove " + heap.remove());
        System.out.println(heap.array.toString());
        System.out.println("remove " + heap.remove());
        System.out.println(heap.array.toString());
        System.out.println("remove " + heap.remove());
        System.out.println(heap.array.toString());
        System.out.println("remove " + heap.remove());
        System.out.println(heap.array.toString());
        System.out.println("remove " + heap.remove());
        System.out.println(heap.array.toString());
        System.out.println("remove " + heap.remove());
        System.out.println(heap.array.toString());
        System.out.println("remove " + heap.remove());
        System.out.println(heap.array.toString());

    }
}