algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-22 15:53:50 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update codes of heap.java and my_heap.java

Browse Source
This commit is contained in:
Yudong Jin
2023-01-08 22:18:23 +08:00
parent e8f7d8f8ba
commit ecabb4077b
7 changed files with 307 additions and 16 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
codes/java/include/PrintUtil.java
View File

@ -105,10 +105,16 @@ public class PrintUtil {
}
}
public static void printHeap(PriorityQueue<Integer> queue) {
Integer[] nums = (Integer[])queue.toArray();
TreeNode root = TreeNode.arrToTree(nums);
/**
* Print a heap (PriorityQueue)
* @param queue
*/
public static void printHeap(Queue<Integer> queue) {
List<Integer> list = new ArrayList<>(queue);
System.out.print("堆的数组表示：");
System.out.println(list);
System.out.println("堆的树状表示：");
TreeNode root = TreeNode.listToTree(list);
printTree(root);
}
}

21
codes/java/include/TreeNode.java
View File

@ -23,26 +23,27 @@ public class TreeNode {
/**
* Generate a binary tree given an array
* @param arr
* @param list
* @return
*/
public static TreeNode arrToTree(Integer[] arr) {
if (arr.length == 0)
public static TreeNode listToTree(List<Integer> list) {
int size = list.size();
if (size == 0)
return null;
TreeNode root = new TreeNode(arr[0]);
TreeNode root = new TreeNode(list.get(0));
Queue<TreeNode> queue = new LinkedList<>() {{ add(root); }};
int i = 0;
while(!queue.isEmpty()) {
TreeNode node = queue.poll();
if (++i >= arr.length) break;
if(arr[i] != null) {
node.left = new TreeNode(arr[i]);
if (++i >= size) break;
if (list.get(i) != null) {
node.left = new TreeNode(list.get(i));
queue.add(node.left);
}
if (++i >= arr.length) break;
if(arr[i] != null) {
node.right = new TreeNode(arr[i]);
if (++i >= size) break;
if (list.get(i) != null) {
node.right = new TreeNode(list.get(i));
queue.add(node.right);
}
}