Re-translate the Japanese version (#1871)

* Retranslate Japanese docs with GPT-5.4

* Retranslate Japanese code with GPT-5.4

ja/codes/go/pkg/print_utils.go

@@ -0,0 +1,118 @@
+// File: print_utils.go
+// Created Time: 2022-12-03
+// Author: Reanon (793584285@qq.com), krahets (krahets@163.com), msk397 (machangxinq@gmail.com)
+
+package pkg
+
+import (
+	"container/list"
+	"fmt"
+	"strconv"
+	"strings"
+)
+
+// PrintSlice はスライスを出力する
+func PrintSlice[T any](nums []T) {
+	fmt.Printf("%v", nums)
+	fmt.Println()
+}
+
+// PrintList はリストを出力する
+func PrintList(list *list.List) {
+	if list.Len() == 0 {
+		fmt.Print("[]\n")
+		return
+	}
+	e := list.Front()
+	// string への強制変換は効率に影響する
+	fmt.Print("[")
+	for e.Next() != nil {
+		fmt.Print(e.Value, " ")
+		e = e.Next()
+	}
+	fmt.Print(e.Value, "]\n")
+}
+
+// PrintMap はハッシュテーブルを出力する
+func PrintMap[K comparable, V any](m map[K]V) {
+	for key, value := range m {
+		fmt.Println(key, "->", value)
+	}
+}
+
+// PrintHeap はヒープを出力する
+func PrintHeap(h []any) {
+	fmt.Printf("ヒープの配列表現：")
+	fmt.Printf("%v", h)
+	fmt.Printf("\nヒープの木構造表示：\n")
+	root := SliceToTree(h)
+	PrintTree(root)
+}
+
+// PrintLinkedList は連結リストを出力する
+func PrintLinkedList(node *ListNode) {
+	if node == nil {
+		return
+	}
+	var builder strings.Builder
+	for node.Next != nil {
+		builder.WriteString(strconv.Itoa(node.Val) + " -> ")
+		node = node.Next
+	}
+	builder.WriteString(strconv.Itoa(node.Val))
+	fmt.Println(builder.String())
+}
+
+// PrintTree は二分木を出力する
+func PrintTree(root *TreeNode) {
+	printTreeHelper(root, nil, false)
+}
+
+// printTreeHelper は二分木を出力する
+// This tree printer is borrowed from TECHIE DELIGHT
+// https://www.techiedelight.com/c-program-print-binary-tree/
+func printTreeHelper(root *TreeNode, prev *trunk, isRight bool) {
+	if root == nil {
+		return
+	}
+	prevStr := "    "
+	trunk := newTrunk(prev, prevStr)
+	printTreeHelper(root.Right, trunk, true)
+	if prev == nil {
+		trunk.str = "———"
+	} else if isRight {
+		trunk.str = "/———"
+		prevStr = "   |"
+	} else {
+		trunk.str = "\\———"
+		prev.str = prevStr
+	}
+	showTrunk(trunk)
+	fmt.Println(root.Val)
+	if prev != nil {
+		prev.str = prevStr
+	}
+	trunk.str = "   |"
+	printTreeHelper(root.Left, trunk, false)
+}
+
+type trunk struct {
+	prev *trunk
+	str  string
+}
+
+func newTrunk(prev *trunk, str string) *trunk {
+	return &trunk{
+		prev: prev,
+		str:  str,
+	}
+}
+
+func showTrunk(t *trunk) {
+	if t == nil {
+		return
+	}
+
+	showTrunk(t.prev)
+	fmt.Print(t.str)
+}