From 10e6dbf415779c85f06d6fc5b171f24bbe116c64 Mon Sep 17 00:00:00 2001
From: ehlxr <ehlxr.me@gmail.com>
Date: Tue, 15 Mar 2022 08:05:53 +0800
Subject: [PATCH] update at 2022-03-15 08:05:53 by ehlxr

---
 .../ehlxr/algorithm/binarytree/heap/Heap.java | 58 +++++++++++++++++++
 1 file changed, 58 insertions(+)
 create mode 100644 budd-common/src/main/java/io/github/ehlxr/algorithm/binarytree/heap/Heap.java

diff --git a/budd-common/src/main/java/io/github/ehlxr/algorithm/binarytree/heap/Heap.java b/budd-common/src/main/java/io/github/ehlxr/algorithm/binarytree/heap/Heap.java
new file mode 100644
index 0000000..5145dc6
--- /dev/null
+++ b/budd-common/src/main/java/io/github/ehlxr/algorithm/binarytree/heap/Heap.java
@@ -0,0 +1,58 @@
+/*
+ * The MIT License (MIT)
+ *
+ * Copyright © 2020 xrv <xrg@live.com>
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+
+package io.github.ehlxr.algorithm.binarytree.heap;
+
+import java.util.Arrays;
+
+/**
+ * @author ehlxr
+ * @since 2022-03-15 07:40.
+ */
+public class Heap {
+
+    public static void main(String[] args) {
+        int[] arr = new int[]{1, 2, 3, 4, 5, 6};
+        System.out.println(Arrays.toString(arr));
+        sweap(arr,2,3);
+        System.out.println(Arrays.toString(arr));
+    }
+
+    public static int[] heapify(int[] arr) {
+
+        for (int i = arr.length - 1; i > 0; i--) {
+            if (arr[i] > arr[i / 2]) {
+
+            }
+        }
+
+        return null;
+    }
+
+    public static void sweap(int[] arr, int i, int j) {
+        int tmp = arr[i];
+        arr[i] = arr[j];
+        arr[j] = tmp;
+    }
+}