From 30497ffd7d3075eb523f2bdd9867e89c6c6c0016 Mon Sep 17 00:00:00 2001 From: Jidong Xiao Date: Mon, 20 Nov 2023 17:07:49 -0500 Subject: [PATCH] fixing the path --- lectures/23_priority_queues_II/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/lectures/23_priority_queues_II/README.md b/lectures/23_priority_queues_II/README.md index 1fca33d..580b170 100644 --- a/lectures/23_priority_queues_II/README.md +++ b/lectures/23_priority_queues_II/README.md @@ -123,4 +123,4 @@ organized heap data, but incur a O(n log n) cost. Why? ## 23.10 Leetcode Exercises - [Leetcode problem 912: Sort an Array](https://leetcode.com/problems/sort-an-array/). Solution: [p912_heapsort_array.cpp](../../leetcode/p912_heapsort_array.cpp). -Solution 2: [p912_heapsort_array_heapify.cpp](../../leetcode/p912_heapsort_array_heapify.cpp). Solution 3 - min heap: [p912_heapsort_array_min_heap.cpp](p912_heapsort_array_min_heap.cpp). +Solution 2: [p912_heapsort_array_heapify.cpp](../../leetcode/p912_heapsort_array_heapify.cpp). Solution 3 - min heap: [p912_heapsort_array_min_heap.cpp](../../leetcode/p912_heapsort_array_min_heap.cpp).