You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
81 lines
1.5 KiB
81 lines
1.5 KiB
=begin
|
|
File: print_util.rb
|
|
Created Time: 2024-03-18
|
|
Author: Xuan Khoa Tu Nguyen (ngxktuzkai2000@gmail.com)
|
|
=end
|
|
|
|
require_relative "./tree_node"
|
|
|
|
### 打印矩阵 ###
|
|
def print_matrix(mat)
|
|
s = []
|
|
mat.each { |arr| s << " #{arr.to_s}" }
|
|
puts "[\n#{s.join(",\n")}\n]"
|
|
end
|
|
|
|
### 打印链表 ###
|
|
def print_linked_list(head)
|
|
list = []
|
|
while head
|
|
list << head.val
|
|
head = head.next
|
|
end
|
|
puts "#{list.join(" -> ")}"
|
|
end
|
|
|
|
class Trunk
|
|
attr_accessor :prev, :str
|
|
|
|
def initialize(prev, str)
|
|
@prev = prev
|
|
@str = str
|
|
end
|
|
end
|
|
|
|
def show_trunk(p)
|
|
return if p.nil?
|
|
|
|
show_trunk(p.prev)
|
|
print p.str
|
|
end
|
|
|
|
### 打印二叉树 ###
|
|
# This tree printer is borrowed from TECHIE DELIGHT
|
|
# https://www.techiedelight.com/c-program-print-binary-tree/
|
|
def print_tree(root, prev=nil, is_right=false)
|
|
return if root.nil?
|
|
|
|
prev_str = " "
|
|
trunk = Trunk.new(prev, prev_str)
|
|
print_tree(root.right, trunk, true)
|
|
|
|
if prev.nil?
|
|
trunk.str = "———"
|
|
elsif is_right
|
|
trunk.str = "/———"
|
|
prev_str = " |"
|
|
else
|
|
trunk.str = "\\———"
|
|
prev.str = prev_str
|
|
end
|
|
|
|
show_trunk(trunk)
|
|
puts " #{root.val}"
|
|
prev.str = prev_str if prev
|
|
trunk.str = " |"
|
|
print_tree(root.left, trunk, false)
|
|
end
|
|
|
|
### 打印哈希表 ###
|
|
def print_hash_map(hmap)
|
|
hmap.entries.each { |key, value| puts "#{key} -> #{value}" }
|
|
end
|
|
|
|
### 打印堆 ###
|
|
def print_heap(heap)
|
|
puts "堆的数组表示：#{heap}"
|
|
puts "堆的树状表示："
|
|
root = arr_to_tree(heap)
|
|
print_tree(root)
|
|
end
|