Add the initial EN translation for C++ code (#1346)

en/codes/python/chapter_backtracking/subset_sum_i_naive.py

@@ -47,4 +47,4 @@ if __name__ == "__main__":
 
     print(f"Input array nums = {nums}, target = {target}")
     print(f"All subsets equal to {target} res = {res}")
-    print(f"Please note that the result of this method includes duplicate sets")
+    print(f"The result of this method includes duplicate sets")

en/codes/python/chapter_graph/graph_adjacency_matrix.py

@@ -24,7 +24,7 @@ class GraphAdjMat:
         for val in vertices:
             self.add_vertex(val)
         # Add edge
-        # Please note, edges elements represent vertex indices, corresponding to vertices elements indices
+        # Edges elements represent vertex indices
         for e in edges:
             self.add_edge(e[0], e[1])
 
@@ -85,7 +85,7 @@ class GraphAdjMat:
 """Driver Code"""
 if __name__ == "__main__":
     # Initialize undirected graph
-    # Please note, edges elements represent vertex indices, corresponding to vertices elements indices
+    # Edges elements represent vertex indices
     vertices = [1, 3, 2, 5, 4]
     edges = [[0, 1], [0, 3], [1, 2], [2, 3], [2, 4], [3, 4]]
     graph = GraphAdjMat(vertices, edges)

en/codes/python/chapter_stack_and_queue/linkedlist_deque.py

@@ -11,7 +11,7 @@ class ListNode:
     def __init__(self, val: int):
         """Constructor"""
         self.val: int = val
-        self.next: ListNode | None = None  # Reference to the next node
+        self.next: ListNode | None = None  # Reference to successor node
         self.prev: ListNode | None = None  # Reference to predecessor node
 
 

en/codes/python/modules/list_node.py

@@ -10,7 +10,7 @@ class ListNode:
 
     def __init__(self, val: int):
         self.val: int = val  # Node value
-        self.next: ListNode | None = None  # Reference to the next node
+        self.next: ListNode | None = None  # Reference to successor node
 
 
 def list_to_linked_list(arr: list[int]) -> ListNode | None: