translation: Add Python and Java code for EN version (#1345)

* Add the intial translation of code of all the languages

* test

* revert

* Remove

* Add Python and Java code for EN version

en/codes/python/modules/__init__.py

@@ -0,0 +1,19 @@
+# Follow the PEP 585 - Type Hinting Generics In Standard Collections
+# https://peps.python.org/pep-0585/
+from __future__ import annotations
+
+# Import common libs here to simplify the code by `from module import *`
+from .list_node import (
+    ListNode,
+    list_to_linked_list,
+    linked_list_to_list,
+)
+from .tree_node import TreeNode, list_to_tree, tree_to_list
+from .vertex import Vertex, vals_to_vets, vets_to_vals
+from .print_util import (
+    print_matrix,
+    print_linked_list,
+    print_tree,
+    print_dict,
+    print_heap,
+)

en/codes/python/modules/list_node.py

@@ -0,0 +1,32 @@
+"""
+File: list_node.py
+Created Time: 2021-12-11
+Author: krahets (krahets@163.com)
+"""
+
+
+class ListNode:
+    """LinkedList node class"""
+
+    def __init__(self, val: int):
+        self.val: int = val  # Node value
+        self.next: ListNode | None = None  # Reference to the next node
+
+
+def list_to_linked_list(arr: list[int]) -> ListNode | None:
+    """Deserialize a list into a linked list"""
+    dum = head = ListNode(0)
+    for a in arr:
+        node = ListNode(a)
+        head.next = node
+        head = head.next
+    return dum.next
+
+
+def linked_list_to_list(head: ListNode | None) -> list[int]:
+    """Serialize a linked list into a list"""
+    arr: list[int] = []
+    while head:
+        arr.append(head.val)
+        head = head.next
+    return arr

en/codes/python/modules/print_util.py

@@ -0,0 +1,81 @@
+"""
+File: print_util.py
+Created Time: 2021-12-11
+Author: krahets (krahets@163.com), msk397 (machangxinq@gmail.com)
+"""
+
+from .tree_node import TreeNode, list_to_tree
+from .list_node import ListNode, linked_list_to_list
+
+
+def print_matrix(mat: list[list[int]]):
+    """Print matrix"""
+    s = []
+    for arr in mat:
+        s.append("  " + str(arr))
+    print("[\n" + ",\n".join(s) + "\n]")
+
+
+def print_linked_list(head: ListNode | None):
+    """Print linked list"""
+    arr: list[int] = linked_list_to_list(head)
+    print(" -> ".join([str(a) for a in arr]))
+
+
+class Trunk:
+    def __init__(self, prev, string: str | None = None):
+        self.prev = prev
+        self.str = string
+
+
+def show_trunks(p: Trunk | None):
+    if p is None:
+        return
+    show_trunks(p.prev)
+    print(p.str, end="")
+
+
+def print_tree(
+    root: TreeNode | None, prev: Trunk | None = None, is_right: bool = False
+):
+    """
+    Print binary tree
+    This tree printer is borrowed from TECHIE DELIGHT
+    https://www.techiedelight.com/c-program-print-binary-tree/
+    """
+    if root is None:
+        return
+
+    prev_str = "    "
+    trunk = Trunk(prev, prev_str)
+    print_tree(root.right, trunk, True)
+
+    if prev is None:
+        trunk.str = "———"
+    elif is_right:
+        trunk.str = "/———"
+        prev_str = "   |"
+    else:
+        trunk.str = "\———"
+        prev.str = prev_str
+
+    show_trunks(trunk)
+    print(" " + str(root.val))
+    if prev:
+        prev.str = prev_str
+    trunk.str = "   |"
+    print_tree(root.left, trunk, False)
+
+
+def print_dict(hmap: dict):
+    """Print dictionary"""
+    for key, value in hmap.items():
+        print(key, "->", value)
+
+
+def print_heap(heap: list[int]):
+    """Print heap"""
+    print("Array representation of the heap:", heap)
+    print("Tree representation of the heap:")
+    root: TreeNode | None = list_to_tree(heap)
+    print_tree(root)

en/codes/python/modules/tree_node.py

@@ -0,0 +1,69 @@
+"""
+File: tree_node.py
+Created Time: 2021-12-11
+Author: krahets (krahets@163.com)
+"""
+
+from collections import deque
+
+
+class TreeNode:
+    """Binary tree node class"""
+
+    def __init__(self, val: int = 0):
+        self.val: int = val  # Node value
+        self.height: int = 0  # Node height
+        self.left: TreeNode | None = None  # Reference to the left child node
+        self.right: TreeNode | None = None  # Reference to the right child node
+
+    # For serialization encoding rules, refer to:
+    # https://www.hello-algo.com/chapter_tree/array_representation_of_tree/
+    # Array representation of the binary tree:
+    # [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15]
+    # Linked list representation of the binary tree:
+    #             /——— 15
+    #         /——— 7
+    #     /——— 3
+    #    |    \——— 6
+    #    |        \——— 12
+    # ——— 1
+    #     \——— 2
+    #        |    /——— 9
+    #         \——— 4
+    #             \——— 8
+
+
+def list_to_tree_dfs(arr: list[int], i: int) -> TreeNode | None:
+    """Deserialize a list into a binary tree: Recursively"""
+    # If the index is out of array bounds, or the corresponding element is None, return None
+    if i < 0 or i >= len(arr) or arr[i] is None:
+        return None
+    # Construct the current node
+    root = TreeNode(arr[i])
+    # Recursively construct left and right subtrees
+    root.left = list_to_tree_dfs(arr, 2 * i + 1)
+    root.right = list_to_tree_dfs(arr, 2 * i + 2)
+    return root
+
+
+def list_to_tree(arr: list[int]) -> TreeNode | None:
+    """Deserialize a list into a binary tree"""
+    return list_to_tree_dfs(arr, 0)
+
+
+def tree_to_list_dfs(root: TreeNode, i: int, res: list[int]) -> list[int]:
+    """Serialize a binary tree into a list: Recursively"""
+    if root is None:
+        return
+    if i >= len(res):
+        res += [None] * (i - len(res) + 1)
+    res[i] = root.val
+    tree_to_list_dfs(root.left, 2 * i + 1, res)
+    tree_to_list_dfs(root.right, 2 * i + 2, res)
+
+
+def tree_to_list(root: TreeNode | None) -> list[int]:
+    """Serialize a binary tree into a list"""
+    res = []
+    tree_to_list_dfs(root, 0, res)
+    return res

en/codes/python/modules/vertex.py

@@ -0,0 +1,20 @@
+# File: vertex.py
+# Created Time: 2023-02-23
+# Author: krahets (krahets@163.com)
+
+
+class Vertex:
+    """Vertex class"""
+
+    def __init__(self, val: int):
+        self.val = val
+
+
+def vals_to_vets(vals: list[int]) -> list["Vertex"]:
+    """Input a list of values vals, return a list of vertices vets"""
+    return [Vertex(val) for val in vals]
+
+
+def vets_to_vals(vets: list["Vertex"]) -> list[int]:
+    """Input a list of vertices vets, return a list of values vals"""
+    return [vet.val for vet in vets]