heap

Author: GreyZeng

src/main/java/grey/algorithm/code11_heap/Code_0011_LintCode_0130_Heapify.java renamed to src/main/java/grey/algorithm/code11_heap/Code_0001_LintCode_0130_Heapify.java

@@ -4,7 +4,10 @@
 // O(n)的时间复杂度完成堆化
 // 笔记：https://www.cnblogs.com/greyzeng/p/16933830.html
 // https://www.lintcode.com/problem/130/
-public class Code_0011_LintCode_0130_Heapify {
+//左孩子 2 * i + 1
+//右孩子 2 * i + 2
+//父节点 （i - 1）/ 2
+public class Code_0001_LintCode_0130_Heapify {
  public void heapify(int[] a) {
  for (int index = a.length - 1; index >= 0; index--) {
  int i = index;

src/main/java/grey/algorithm/code11_heap/Code_0011_MaxHeap.java renamed to src/main/java/grey/algorithm/code11_heap/Code_0002_MaxHeap.java

@@ -23,11 +23,11 @@
 // 父节点 i / 2 即：i >> 1
 // 大根堆：完全二叉树中，每棵树的最大值都是头节点的值
 // heapify和heapInsert都是logN级别的复杂度，因为N个节点的二叉树高度是logN
-public class Code_0011_MaxHeap {
+public class Code_0002_MaxHeap {
  private final int[] heap;
  private int heapSize;
 
- public Code_0011_MaxHeap(int limit) {
+ public Code_0002_MaxHeap(int limit) {
  heap = new int[limit];
  heapSize = 0;
  }
@@ -102,7 +102,7 @@ public static void testHeap() {
  System.out.println("test start");
  for (int i = 0; i < testTimes; i++) {
  int curLimit = (int) (Math.random() * limit) + 1;
- Code_0011_MaxHeap my = new Code_0011_MaxHeap(curLimit);
+ Code_0002_MaxHeap my = new Code_0002_MaxHeap(curLimit);
  PriorityQueue<Integer> test = new PriorityQueue<>((o1, o2) -> o2 - o1);
  int curOpTimes = (int) (Math.random() * limit);
  for (int j = 0; j < curOpTimes; j++) {

src/main/java/grey/algorithm/code11_heap/Code_0011_Luogu_P1177_HeapSort.java renamed to src/main/java/grey/algorithm/code11_heap/Code_0003_Luogu_P1177_HeapSort.java

@@ -11,7 +11,7 @@
 // 堆排序额外空间复杂度O(1)
 // 测评：https://www.lintcode.com/problem/464
 //测评链接：https://www.luogu.com.cn/problem/P1177
-public class Code_0011_Luogu_P1177_HeapSort {
+public class Code_0003_Luogu_P1177_HeapSort {
  public static int MAXN = 100001;
  public static int[] arr = new int[MAXN];
  public static int n;