build

chapter_sorting/insertion_sort.md

@@ -67,8 +67,8 @@ comments: true
         """插入排序"""
         # 外循环：base = nums[1], nums[2], ..., nums[n-1]
         for i in range(1, len(nums)):
-            base: int = nums[i]
-            j: int = i - 1
+            base = nums[i]
+            j = i - 1
             # 内循环：将 base 插入到左边的正确位置
             while j >= 0 and nums[j] > base:
                 nums[j + 1] = nums[j]  # 1. 将 nums[j] 向右移动一位