fuhouyin/hello-algo
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

add zig codes for Section 'Heap' (heap.zig)

Browse Source
This commit is contained in:
sjinzh 2023-01-14 22:30:56 +08:00
parent 5bda3dd91f
commit bf907e1715
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
codes/java/chapter_tree/binary_tree_bfs.java
View File

@ -13,7 +13,7 @@ public class binary_tree_bfs {
/* 层序遍历 */
static List<Integer> hierOrder(TreeNode root) {
// 初始化队列，加入根结点
Queue<TreeNode> queue = new LinkedList<TreeNode>() {{ add(root); }};
Queue<TreeNode> queue = new LinkedList<>() {{ add(root); }};
// 初始化一个列表，用于保存遍历序列
List<Integer> list = new ArrayList<>();
while (!queue.isEmpty()) {

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

@ -32,7 +32,7 @@ public class TreeNode {
return null;
TreeNode root = new TreeNode(list.get(0));
Queue<TreeNode> queue = new LinkedList<TreeNode>() {{ add(root); }};
Queue<TreeNode> queue = new LinkedList<>() {{ add(root); }};
int i = 0;
while(!queue.isEmpty()) {
TreeNode node = queue.poll();
@ -58,7 +58,7 @@ public class TreeNode {
public static List<Integer> treeToList(TreeNode root) {
List<Integer> list = new ArrayList<>();
if(root == null) return list;
Queue<TreeNode> queue = new LinkedList<TreeNode>() {{ add(root); }};
Queue<TreeNode> queue = new LinkedList<>() {{ add(root); }};
while(!queue.isEmpty()) {
TreeNode node = queue.poll();
if(node != null) {