build

chapter_array_and_linkedlist/array.md

@@ -494,7 +494,7 @@ elementAddr = firtstElementAddr + elementLength * elementIndex
 === "Python"
 
     ```python title="array.py"
-    def insert(nums: list[int], num: int, index: int) -> None:
+    def insert(nums: list[int], num: int, index: int):
         """在数组的索引 index 处插入元素 num"""
         # 把索引 index 以及之后的所有元素向后移动一位
         for i in range(len(nums) - 1, index, -1):
@@ -649,7 +649,7 @@ elementAddr = firtstElementAddr + elementLength * elementIndex
 === "Python"
 
     ```python title="array.py"
-    def remove(nums: list[int], index: int) -> None:
+    def remove(nums: list[int], index: int):
         """删除索引 index 处元素"""
         # 把索引 index 之后的所有元素向前移动一位
         for i in range(index, len(nums) - 1):
@@ -798,7 +798,7 @@ elementAddr = firtstElementAddr + elementLength * elementIndex
 === "Python"
 
     ```python title="array.py"
-    def traverse(nums: list[int]) -> None:
+    def traverse(nums: list[int]):
         """遍历数组"""
         count = 0
         # 通过索引遍历数组

chapter_array_and_linkedlist/linked_list.md

@@ -117,8 +117,7 @@ comments: true
 
     ```csharp title=""
     /* 链表节点类 */
-    class ListNode
-    {
+    class ListNode {
         int val;         // 节点值
         ListNode next;   // 指向下一节点的引用
         ListNode(int x) => val = x;  //构造函数
@@ -400,7 +399,7 @@ comments: true
 === "Python"
 
     ```python title="linked_list.py"
-    def insert(n0: ListNode, P: ListNode) -> None:
+    def insert(n0: ListNode, P: ListNode):
         """在链表的节点 n0 之后插入节点 P"""
         n1 = n0.next
         P.next = n1
@@ -534,7 +533,7 @@ comments: true
 === "Python"
 
     ```python title="linked_list.py"
-    def remove(n0: ListNode) -> None:
+    def remove(n0: ListNode):
         """删除链表的节点 n0 之后的首个节点"""
         if not n0.next:
             return

chapter_array_and_linkedlist/list.md

@@ -543,15 +543,13 @@ comments: true
     ```csharp title="list.cs"
     /* 通过索引遍历列表 */
     int count = 0;
-    for (int i = 0; i < list.Count(); i++)
-    {
+    for (int i = 0; i < list.Count; i++) {
         count++;
     }
 
     /* 直接遍历列表元素 */
     count = 0;
-    foreach (int n in list)
-    {
+    foreach (int n in list) {
         count++;
     }
     ```
@@ -1029,13 +1027,13 @@ comments: true
                 raise IndexError("索引越界")
             return self.__nums[index]
 
-        def set(self, num: int, index: int) -> None:
+        def set(self, num: int, index: int):
             """更新元素"""
             if index < 0 or index >= self.__size:
                 raise IndexError("索引越界")
             self.__nums[index] = num
 
-        def add(self, num: int) -> None:
+        def add(self, num: int):
             """尾部添加元素"""
             # 元素数量超出容量时，触发扩容机制
             if self.size() == self.capacity():
@@ -1043,7 +1041,7 @@ comments: true
             self.__nums[self.__size] = num
             self.__size += 1
 
-        def insert(self, num: int, index: int) -> None:
+        def insert(self, num: int, index: int):
             """中间插入元素"""
             if index < 0 or index >= self.__size:
                 raise IndexError("索引越界")
@@ -1070,7 +1068,7 @@ comments: true
             # 返回被删除元素
             return num
 
-        def extend_capacity(self) -> None:
+        def extend_capacity(self):
             """列表扩容"""
             # 新建一个长度为原数组 __extend_ratio 倍的新数组，并将原数组拷贝到新数组
             self.__nums = self.__nums + [0] * self.capacity() * (self.__extend_ratio - 1)
@@ -1583,7 +1581,7 @@ comments: true
         /* 列表扩容 */
         public void extendCapacity() {
             // 新建一个长度为 numsCapacity * extendRatio 的数组，并将原数组拷贝到新数组
-            System.Array.Resize(ref nums, numsCapacity * extendRatio);
+            Array.Resize(ref nums, numsCapacity * extendRatio);
             // 更新列表容量
             numsCapacity = nums.Length;
         }