diff --git a/codes/go/chapter_heap/my_heap.go b/codes/go/chapter_heap/my_heap.go
index 0b3d0a3b1..cd3015f66 100644
--- a/codes/go/chapter_heap/my_heap.go
+++ b/codes/go/chapter_heap/my_heap.go
@@ -98,6 +98,7 @@ func (h *maxHeap) poll() any {
 	// 判空处理
 	if h.isEmpty() {
 		fmt.Println("error")
+		return nil
 	}
 	// 交换根结点与最右叶结点（即交换首元素与尾元素）
 	h.swap(0, h.size()-1)
diff --git a/docs/chapter_heap/heap.md b/docs/chapter_heap/heap.md
index 15d22e787..e1d29fe36 100644
--- a/docs/chapter_heap/heap.md
+++ b/docs/chapter_heap/heap.md
@@ -606,6 +606,7 @@ comments: true
         // 判空处理
         if h.isEmpty() {
             fmt.Println("error")
+			return nil
         }
         // 交换根结点与最右叶结点（即交换首元素与尾元素）
         h.swap(0, h.size()-1)
diff --git a/docs/chapter_sorting/quick_sort.md b/docs/chapter_sorting/quick_sort.md
index 06f04efd5..2c000e198 100644
--- a/docs/chapter_sorting/quick_sort.md
+++ b/docs/chapter_sorting/quick_sort.md
@@ -490,7 +490,7 @@ comments: true
     func medianThree(nums []int, left, mid, right int) int {
         if (nums[left] < nums[mid]) != (nums[left] < nums[right]) {
             return left
-        } else if (nums[mid] < nums[left]) != (nums[mid] > nums[right]) {
+        } else if (nums[mid] > nums[left]) != (nums[mid] > nums[right]) {
             return mid
         }
         return right